./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:55:04,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:55:04,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 08:55:04,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:55:04,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:55:04,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:55:04,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:55:04,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:55:04,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:55:04,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:55:04,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:55:04,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:55:04,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:55:04,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:55:04,320 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:55:04,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:55:04,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:55:04,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:55:04,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:55:04,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:55:04,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:55:04,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:55:04,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:55:04,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:55:04,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:55:04,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:55:04,322 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-jdk21/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 -> 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b [2025-02-08 08:55:04,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:55:04,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:55:04,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:55:04,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:55:04,568 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:55:04,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2025-02-08 08:55:05,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b13bcec89/516315043f74488aa8324c7230f9b980/FLAG1ddbd5985 [2025-02-08 08:55:05,902 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:55:05,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2025-02-08 08:55:05,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b13bcec89/516315043f74488aa8324c7230f9b980/FLAG1ddbd5985 [2025-02-08 08:55:06,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b13bcec89/516315043f74488aa8324c7230f9b980 [2025-02-08 08:55:06,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:55:06,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:55:06,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:55:06,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:55:06,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:55:06,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da35d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06, skipping insertion in model container [2025-02-08 08:55:06,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:55:06,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:55:06,392 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:55:06,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:55:06,412 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:55:06,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06 WrapperNode [2025-02-08 08:55:06,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:55:06,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:55:06,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:55:06,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:55:06,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,432 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2025-02-08 08:55:06,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:55:06,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:55:06,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:55:06,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:55:06,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,446 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 08:55:06,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:55:06,452 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:55:06,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:55:06,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:55:06,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:55:06,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:06,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:55:06,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:55:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2025-02-08 08:55:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2025-02-08 08:55:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2025-02-08 08:55:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2025-02-08 08:55:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:55:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:55:06,538 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:55:06,540 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:55:06,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; [2025-02-08 08:55:06,614 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret3;havoc #t~ret4; [2025-02-08 08:55:06,626 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-08 08:55:06,626 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:55:06,632 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:55:06,632 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:55:06,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:06 BoogieIcfgContainer [2025-02-08 08:55:06,633 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:55:06,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:55:06,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:55:06,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:55:06,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:55:06" (1/3) ... [2025-02-08 08:55:06,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438e31a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:55:06, skipping insertion in model container [2025-02-08 08:55:06,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (2/3) ... [2025-02-08 08:55:06,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438e31a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:55:06, skipping insertion in model container [2025-02-08 08:55:06,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:06" (3/3) ... [2025-02-08 08:55:06,639 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2025-02-08 08:55:06,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:55:06,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_1d.c that has 3 procedures, 43 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-02-08 08:55:06,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:55:06,696 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;@c7c0435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:55:06,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 08:55:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 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-02-08 08:55:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:55:06,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:06,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:06,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:06,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 180342059, now seen corresponding path program 1 times [2025-02-08 08:55:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524634496] [2025-02-08 08:55:06,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:06,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:55:06,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:55:06,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:06,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524634496] [2025-02-08 08:55:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524634496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:06,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:06,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695528964] [2025-02-08 08:55:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:06,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:06,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:06,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:06,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:06,861 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-08 08:55:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:06,890 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-02-08 08:55:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:06,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 8 [2025-02-08 08:55:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:06,896 INFO L225 Difference]: With dead ends: 45 [2025-02-08 08:55:06,897 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 08:55:06,899 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-02-08 08:55:06,903 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 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-02-08 08:55:06,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 08:55:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-02-08 08:55:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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-02-08 08:55:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-08 08:55:06,934 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 8 [2025-02-08 08:55:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:06,934 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-08 08:55:06,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02-08 08:55:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-08 08:55:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 08:55:06,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:06,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:06,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:55:06,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:06,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1295636518, now seen corresponding path program 1 times [2025-02-08 08:55:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414171968] [2025-02-08 08:55:06,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:06,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:55:06,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:55:06,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:06,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414171968] [2025-02-08 08:55:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414171968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411144132] [2025-02-08 08:55:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:55:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:55:07,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:55:07,020 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-08 08:55:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,158 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2025-02-08 08:55:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2025-02-08 08:55:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,160 INFO L225 Difference]: With dead ends: 80 [2025-02-08 08:55:07,160 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 08:55:07,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:55:07,160 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 222 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 08:55:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2025-02-08 08:55:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 50 states have internal predecessors, (61), 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-02-08 08:55:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2025-02-08 08:55:07,175 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2025-02-08 08:55:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,175 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2025-02-08 08:55:07,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-08 08:55:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2025-02-08 08:55:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:55:07,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:55:07,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash -434559964, now seen corresponding path program 1 times [2025-02-08 08:55:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880467336] [2025-02-08 08:55:07,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:55:07,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:55:07,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880467336] [2025-02-08 08:55:07,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880467336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088129842] [2025-02-08 08:55:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:07,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:07,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:07,219 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,242 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2025-02-08 08:55:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:07,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 08:55:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,245 INFO L225 Difference]: With dead ends: 86 [2025-02-08 08:55:07,246 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 08:55:07,246 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-02-08 08:55:07,248 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 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-02-08 08:55:07,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 08:55:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2025-02-08 08:55:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 56 states have internal predecessors, (67), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-08 08:55:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2025-02-08 08:55:07,266 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 11 [2025-02-08 08:55:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,266 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2025-02-08 08:55:07,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2025-02-08 08:55:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:55:07,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:55:07,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash -586456996, now seen corresponding path program 1 times [2025-02-08 08:55:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261813151] [2025-02-08 08:55:07,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:55:07,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:55:07,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261813151] [2025-02-08 08:55:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261813151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:07,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5330377] [2025-02-08 08:55:07,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:07,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:07,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:07,290 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,302 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2025-02-08 08:55:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 08:55:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,303 INFO L225 Difference]: With dead ends: 73 [2025-02-08 08:55:07,303 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 08:55:07,303 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-02-08 08:55:07,304 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 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-02-08 08:55:07,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 08:55:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 08:55:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 55 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-08 08:55:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2025-02-08 08:55:07,311 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 12 [2025-02-08 08:55:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,311 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2025-02-08 08:55:07,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2025-02-08 08:55:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:55:07,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,312 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:55:07,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash 572915139, now seen corresponding path program 1 times [2025-02-08 08:55:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390340321] [2025-02-08 08:55:07,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:55:07,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:55:07,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390340321] [2025-02-08 08:55:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390340321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82947117] [2025-02-08 08:55:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:07,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:07,345 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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-02-08 08:55:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,363 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2025-02-08 08:55:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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 16 [2025-02-08 08:55:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,364 INFO L225 Difference]: With dead ends: 93 [2025-02-08 08:55:07,364 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 08:55:07,364 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-02-08 08:55:07,365 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 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-02-08 08:55:07,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 08:55:07,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2025-02-08 08:55:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 57 states have internal predecessors, (69), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-08 08:55:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2025-02-08 08:55:07,372 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2025-02-08 08:55:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2025-02-08 08:55:07,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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-02-08 08:55:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2025-02-08 08:55:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:55:07,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,373 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:55:07,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash 580500104, now seen corresponding path program 1 times [2025-02-08 08:55:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311847857] [2025-02-08 08:55:07,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:55:07,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:55:07,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311847857] [2025-02-08 08:55:07,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311847857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:07,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65617744] [2025-02-08 08:55:07,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:07,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:07,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:07,400 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-02-08 08:55:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,411 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2025-02-08 08:55:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:07,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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 17 [2025-02-08 08:55:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,412 INFO L225 Difference]: With dead ends: 76 [2025-02-08 08:55:07,412 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 08:55:07,412 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-02-08 08:55:07,413 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 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-02-08 08:55:07,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 08:55:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 08:55:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 56 states have internal predecessors, (67), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-08 08:55:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2025-02-08 08:55:07,421 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 17 [2025-02-08 08:55:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,421 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-02-08 08:55:07,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-02-08 08:55:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2025-02-08 08:55:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:55:07,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,422 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:55:07,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1716590880, now seen corresponding path program 1 times [2025-02-08 08:55:07,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429251784] [2025-02-08 08:55:07,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:55:07,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:55:07,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429251784] [2025-02-08 08:55:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429251784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:07,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818660606] [2025-02-08 08:55:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:07,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:07,469 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,485 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2025-02-08 08:55:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:07,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-08 08:55:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,486 INFO L225 Difference]: With dead ends: 84 [2025-02-08 08:55:07,486 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 08:55:07,487 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-02-08 08:55:07,487 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 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-02-08 08:55:07,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 08:55:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-08 08:55:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.263157894736842) internal successors, (72), 60 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (20), 16 states have call predecessors, (20), 10 states have call successors, (20) [2025-02-08 08:55:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-02-08 08:55:07,495 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 19 [2025-02-08 08:55:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,496 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-02-08 08:55:07,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-02-08 08:55:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:55:07,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:55:07,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1714442940, now seen corresponding path program 1 times [2025-02-08 08:55:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679574490] [2025-02-08 08:55:07,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:55:07,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:55:07,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679574490] [2025-02-08 08:55:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679574490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033610075] [2025-02-08 08:55:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:55:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:55:07,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:55:07,540 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 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-02-08 08:55:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,606 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2025-02-08 08:55:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:55:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 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 20 [2025-02-08 08:55:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,607 INFO L225 Difference]: With dead ends: 131 [2025-02-08 08:55:07,607 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 08:55:07,608 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-02-08 08:55:07,608 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 104 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 08:55:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-08 08:55:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-08 08:55:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2025-02-08 08:55:07,622 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 20 [2025-02-08 08:55:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,622 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2025-02-08 08:55:07,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 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-02-08 08:55:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2025-02-08 08:55:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 08:55:07,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,623 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:55:07,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,623 INFO L85 PathProgramCache]: Analyzing trace with hash -480586747, now seen corresponding path program 1 times [2025-02-08 08:55:07,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785499013] [2025-02-08 08:55:07,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:55:07,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:55:07,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785499013] [2025-02-08 08:55:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785499013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762012363] [2025-02-08 08:55:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:07,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:07,669 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-02-08 08:55:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,715 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2025-02-08 08:55:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:07,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2025-02-08 08:55:07,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,717 INFO L225 Difference]: With dead ends: 160 [2025-02-08 08:55:07,717 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 08:55:07,718 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-02-08 08:55:07,718 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 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-02-08 08:55:07,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 08:55:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2025-02-08 08:55:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 65 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2025-02-08 08:55:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2025-02-08 08:55:07,726 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 22 [2025-02-08 08:55:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,726 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2025-02-08 08:55:07,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-02-08 08:55:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2025-02-08 08:55:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 08:55:07,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,727 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] [2025-02-08 08:55:07,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:55:07,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1292504350, now seen corresponding path program 1 times [2025-02-08 08:55:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405353640] [2025-02-08 08:55:07,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:55:07,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:55:07,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 08:55:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405353640] [2025-02-08 08:55:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405353640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477613554] [2025-02-08 08:55:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:07,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:07,774 INFO L87 Difference]: Start difference. First operand 85 states and 106 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, (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-02-08 08:55:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,811 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2025-02-08 08:55:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:07,811 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, (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 33 [2025-02-08 08:55:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,812 INFO L225 Difference]: With dead ends: 170 [2025-02-08 08:55:07,812 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 08:55:07,812 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-02-08 08:55:07,813 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 190 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-02-08 08:55:07,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 190 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 08:55:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2025-02-08 08:55:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 70 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-08 08:55:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2025-02-08 08:55:07,820 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 33 [2025-02-08 08:55:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,820 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2025-02-08 08:55:07,820 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, (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-02-08 08:55:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2025-02-08 08:55:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 08:55:07,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,821 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] [2025-02-08 08:55:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:55:07,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash 850385268, now seen corresponding path program 1 times [2025-02-08 08:55:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924067523] [2025-02-08 08:55:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:55:07,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:55:07,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-08 08:55:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924067523] [2025-02-08 08:55:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924067523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:07,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731947448] [2025-02-08 08:55:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:07,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:07,846 INFO L87 Difference]: Start difference. First operand 93 states and 115 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, (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-02-08 08:55:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,854 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2025-02-08 08:55:07,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:07,854 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, (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 35 [2025-02-08 08:55:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,855 INFO L225 Difference]: With dead ends: 93 [2025-02-08 08:55:07,855 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 08:55:07,855 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-02-08 08:55:07,856 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 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-02-08 08:55:07,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 08:55:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 08:55:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 69 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-08 08:55:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2025-02-08 08:55:07,863 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 35 [2025-02-08 08:55:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,863 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2025-02-08 08:55:07,863 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, (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-02-08 08:55:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2025-02-08 08:55:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 08:55:07,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,864 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] [2025-02-08 08:55:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:55:07,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1344689876, now seen corresponding path program 1 times [2025-02-08 08:55:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447104065] [2025-02-08 08:55:07,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:55:07,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:55:07,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:55:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447104065] [2025-02-08 08:55:07,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447104065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150362347] [2025-02-08 08:55:07,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:07,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:07,898 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02-08 08:55:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,911 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-02-08 08:55:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:07,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 31 [2025-02-08 08:55:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,912 INFO L225 Difference]: With dead ends: 99 [2025-02-08 08:55:07,912 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 08:55:07,913 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-02-08 08:55:07,913 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 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-02-08 08:55:07,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 08:55:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 08:55:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 73 states have internal predecessors, (82), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 18 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-08 08:55:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2025-02-08 08:55:07,919 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 31 [2025-02-08 08:55:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,920 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2025-02-08 08:55:07,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-02-08 08:55:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2025-02-08 08:55:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 08:55:07,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,921 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] [2025-02-08 08:55:07,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:55:07,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 819316549, now seen corresponding path program 1 times [2025-02-08 08:55:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870066545] [2025-02-08 08:55:07,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 08:55:07,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 08:55:07,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 08:55:07,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870066545] [2025-02-08 08:55:07,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870066545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689575100] [2025-02-08 08:55:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:07,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:07,972 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-08 08:55:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,004 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2025-02-08 08:55:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:08,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 45 [2025-02-08 08:55:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,005 INFO L225 Difference]: With dead ends: 108 [2025-02-08 08:55:08,005 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 08:55:08,005 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-02-08 08:55:08,006 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:08,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 08:55:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2025-02-08 08:55:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 72 states have internal predecessors, (80), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 18 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-08 08:55:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-02-08 08:55:08,012 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 45 [2025-02-08 08:55:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,012 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-02-08 08:55:08,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-08 08:55:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2025-02-08 08:55:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 08:55:08,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:55:08,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1799743241, now seen corresponding path program 1 times [2025-02-08 08:55:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921490119] [2025-02-08 08:55:08,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:55:08,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:55:08,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:55:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921490119] [2025-02-08 08:55:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921490119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043122035] [2025-02-08 08:55:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:08,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:08,079 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-08 08:55:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,097 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2025-02-08 08:55:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:55:08,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 35 [2025-02-08 08:55:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,098 INFO L225 Difference]: With dead ends: 97 [2025-02-08 08:55:08,098 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 08:55:08,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:08,099 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:08,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 08:55:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 08:55:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 71 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 18 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-08 08:55:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2025-02-08 08:55:08,104 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 35 [2025-02-08 08:55:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,104 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2025-02-08 08:55:08,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-08 08:55:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2025-02-08 08:55:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 08:55:08,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,105 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] [2025-02-08 08:55:08,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:55:08,106 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1808141305, now seen corresponding path program 1 times [2025-02-08 08:55:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006755919] [2025-02-08 08:55:08,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 08:55:08,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:55:08,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 08:55:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006755919] [2025-02-08 08:55:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006755919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513636929] [2025-02-08 08:55:08,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:08,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:08,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:08,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:55:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 08:55:08,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:55:08,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:55:08,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 08:55:08,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 08:55:08,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513636929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:08,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:08,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 08:55:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948750466] [2025-02-08 08:55:08,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:55:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:55:08,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:55:08,366 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 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-02-08 08:55:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,540 INFO L93 Difference]: Finished difference Result 213 states and 261 transitions. [2025-02-08 08:55:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:55:08,541 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 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 51 [2025-02-08 08:55:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,542 INFO L225 Difference]: With dead ends: 213 [2025-02-08 08:55:08,542 INFO L226 Difference]: Without dead ends: 129 [2025-02-08 08:55:08,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-02-08 08:55:08,543 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:08,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 248 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-08 08:55:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2025-02-08 08:55:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 78 states have internal predecessors, (84), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (18), 18 states have call predecessors, (18), 16 states have call successors, (18) [2025-02-08 08:55:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2025-02-08 08:55:08,549 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 51 [2025-02-08 08:55:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,549 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2025-02-08 08:55:08,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 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-02-08 08:55:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2025-02-08 08:55:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 08:55:08,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,551 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:08,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:55:08,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 08:55:08,755 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 535822711, now seen corresponding path program 1 times [2025-02-08 08:55:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963215720] [2025-02-08 08:55:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 08:55:08,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 08:55:08,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:55:08,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963215720] [2025-02-08 08:55:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963215720] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456058154] [2025-02-08 08:55:08,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:08,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:08,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:08,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:55:08,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 08:55:08,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 08:55:08,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:55:08,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:55:08,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:55:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456058154] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:08,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-02-08 08:55:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137955333] [2025-02-08 08:55:08,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:55:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:55:08,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:55:08,942 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 08:55:08,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,984 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2025-02-08 08:55:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:55:08,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-02-08 08:55:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,986 INFO L225 Difference]: With dead ends: 121 [2025-02-08 08:55:08,986 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 08:55:08,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:55:08,986 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:08,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 08:55:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-02-08 08:55:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 08:55:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-02-08 08:55:08,990 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 44 [2025-02-08 08:55:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,991 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-02-08 08:55:08,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 08:55:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-02-08 08:55:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 08:55:08,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,991 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-02-08 08:55:09,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:55:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 08:55:09,192 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 496089493, now seen corresponding path program 1 times [2025-02-08 08:55:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325915848] [2025-02-08 08:55:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:09,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 08:55:09,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 08:55:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:55:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325915848] [2025-02-08 08:55:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325915848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:09,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199878903] [2025-02-08 08:55:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:09,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:09,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:09,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:09,224 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-08 08:55:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:09,229 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-02-08 08:55:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:09,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 44 [2025-02-08 08:55:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:09,229 INFO L225 Difference]: With dead ends: 57 [2025-02-08 08:55:09,229 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:55:09,230 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-02-08 08:55:09,230 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:09,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:55:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:55:09,231 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-02-08 08:55:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:55:09,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-02-08 08:55:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:09,232 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:55:09,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-08 08:55:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:55:09,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:55:09,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-08 08:55:09,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-02-08 08:55:09,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:55:09,238 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:09,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:55:09,571 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:55:09,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:55:09 BoogieIcfgContainer [2025-02-08 08:55:09,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:55:09,576 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:55:09,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:55:09,576 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:55:09,576 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:06" (3/4) ... [2025-02-08 08:55:09,578 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:55:09,581 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec1 [2025-02-08 08:55:09,582 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec2 [2025-02-08 08:55:09,584 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:55:09,584 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:55:09,584 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:55:09,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:55:09,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:55:09,638 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:55:09,639 INFO L158 Benchmark]: Toolchain (without parser) took 3368.01ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 82.3MB in the end (delta: 42.8MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-02-08 08:55:09,639 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:55:09,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.70ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 115.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:55:09,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.76ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 114.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:55:09,639 INFO L158 Benchmark]: Boogie Preprocessor took 18.42ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 113.7MB in the end (delta: 593.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:55:09,640 INFO L158 Benchmark]: IcfgBuilder took 180.72ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 101.6MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:55:09,640 INFO L158 Benchmark]: TraceAbstraction took 2941.23ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 89.0MB in the end (delta: 12.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2025-02-08 08:55:09,640 INFO L158 Benchmark]: Witness Printer took 62.32ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 82.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:55:09,641 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.27ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.70ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 115.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.76ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 114.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.42ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 113.7MB in the end (delta: 593.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 180.72ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 101.6MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2941.23ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 89.0MB in the end (delta: 12.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Witness Printer took 62.32ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 82.3MB in the end (delta: 6.7MB). 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, 43 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 2203 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1544 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 565 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 659 mSDtfsCounter, 565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 195 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 98 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 945 SizeOfPredicates, 2 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 516/528 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-02-08 08:55:09,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE