./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:28:33,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:28:33,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:28:33,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:28:33,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:28:33,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:28:33,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:28:33,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:28:33,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:28:33,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:28:33,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:28:33,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:28:33,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:28:33,094 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:28:33,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:33,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:28:33,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c [2025-03-04 10:28:33,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:28:33,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:28:33,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:28:33,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:28:33,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:28:33,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2025-03-04 10:28:34,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1014dcb7/dba2b921a9b44dc78e17c9b08249b6a6/FLAG43ade0332 [2025-03-04 10:28:34,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:28:34,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2025-03-04 10:28:34,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1014dcb7/dba2b921a9b44dc78e17c9b08249b6a6/FLAG43ade0332 [2025-03-04 10:28:34,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1014dcb7/dba2b921a9b44dc78e17c9b08249b6a6 [2025-03-04 10:28:34,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:28:34,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:28:34,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:34,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:28:34,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:28:34,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34, skipping insertion in model container [2025-03-04 10:28:34,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:28:34,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:34,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:28:34,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:34,819 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:28:34,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34 WrapperNode [2025-03-04 10:28:34,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:34,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:34,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:28:34,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:28:34,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,839 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2025-03-04 10:28:34,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:34,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:28:34,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:28:34,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:28:34,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,855 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:28:34,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:28:34,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:28:34,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:28:34,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:28:34,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (1/1) ... [2025-03-04 10:28:34,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:34,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:28:34,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:28:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2025-03-04 10:28:34,923 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2025-03-04 10:28:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2025-03-04 10:28:34,923 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2025-03-04 10:28:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:28:34,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:28:34,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:28:34,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:28:35,021 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; [2025-03-04 10:28:35,052 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret3;havoc #t~ret4; [2025-03-04 10:28:35,072 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 10:28:35,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:28:35,080 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:28:35,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:28:35,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:35 BoogieIcfgContainer [2025-03-04 10:28:35,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:28:35,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:28:35,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:28:35,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:28:35,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:28:34" (1/3) ... [2025-03-04 10:28:35,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f34e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:35, skipping insertion in model container [2025-03-04 10:28:35,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:34" (2/3) ... [2025-03-04 10:28:35,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f34e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:35, skipping insertion in model container [2025-03-04 10:28:35,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:35" (3/3) ... [2025-03-04 10:28:35,088 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2025-03-04 10:28:35,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:28:35,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_1b.c that has 3 procedures, 45 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-04 10:28:35,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:28:35,145 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;@30f6486f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:28:35,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 10:28:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:28:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:28:35,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:35,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:28:35,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:35,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2106363572, now seen corresponding path program 1 times [2025-03-04 10:28:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:35,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944414296] [2025-03-04 10:28:35,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:35,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:28:35,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:28:35,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:35,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944414296] [2025-03-04 10:28:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944414296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:35,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:35,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153941257] [2025-03-04 10:28:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:35,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:35,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:35,292 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:35,320 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-03-04 10:28:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:35,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:28:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:35,326 INFO L225 Difference]: With dead ends: 47 [2025-03-04 10:28:35,327 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 10:28:35,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:35,331 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:35,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 10:28:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-04 10:28:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:28:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-03-04 10:28:35,358 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2025-03-04 10:28:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:35,358 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-04 10:28:35,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-03-04 10:28:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:28:35,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:35,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:35,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:28:35,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:35,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:35,359 INFO L85 PathProgramCache]: Analyzing trace with hash -872761290, now seen corresponding path program 1 times [2025-03-04 10:28:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:35,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017602519] [2025-03-04 10:28:35,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:35,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:35,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:28:35,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:28:35,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:35,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:35,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:35,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017602519] [2025-03-04 10:28:35,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017602519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:35,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:35,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:28:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452791958] [2025-03-04 10:28:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:35,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:28:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:35,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:28:35,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:28:35,412 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:35,472 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2025-03-04 10:28:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:28:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:28:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:35,473 INFO L225 Difference]: With dead ends: 57 [2025-03-04 10:28:35,473 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 10:28:35,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:35,474 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:35,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 160 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 10:28:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-03-04 10:28:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:28:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-03-04 10:28:35,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 7 [2025-03-04 10:28:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:35,484 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-04 10:28:35,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-03-04 10:28:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:28:35,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:35,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:35,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:28:35,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:35,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1659007762, now seen corresponding path program 1 times [2025-03-04 10:28:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532747893] [2025-03-04 10:28:35,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:35,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:28:35,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:28:35,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:35,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532747893] [2025-03-04 10:28:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532747893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:35,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:35,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095511021] [2025-03-04 10:28:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:35,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:35,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:35,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:35,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:35,518 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:35,543 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-03-04 10:28:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:35,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:28:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:35,545 INFO L225 Difference]: With dead ends: 52 [2025-03-04 10:28:35,545 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 10:28:35,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:35,546 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:35,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 10:28:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-04 10:28:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:28:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-04 10:28:35,553 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 11 [2025-03-04 10:28:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:35,554 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-04 10:28:35,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-04 10:28:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:28:35,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:35,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:35,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:28:35,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:35,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash -110366945, now seen corresponding path program 1 times [2025-03-04 10:28:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:35,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118866135] [2025-03-04 10:28:35,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:35,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:28:35,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:28:35,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:35,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118866135] [2025-03-04 10:28:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118866135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:35,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:28:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069594646] [2025-03-04 10:28:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:35,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:28:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:35,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:28:35,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:28:35,672 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:35,792 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2025-03-04 10:28:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:28:35,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:28:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:35,793 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:28:35,793 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:28:35,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-03-04 10:28:35,795 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:35,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 187 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:28:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2025-03-04 10:28:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:28:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-03-04 10:28:35,802 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 12 [2025-03-04 10:28:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:35,803 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-03-04 10:28:35,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-03-04 10:28:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:28:35,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:35,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:35,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:28:35,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:35,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 246567476, now seen corresponding path program 1 times [2025-03-04 10:28:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197948160] [2025-03-04 10:28:35,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:35,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:28:35,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:28:35,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:35,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197948160] [2025-03-04 10:28:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197948160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360873718] [2025-03-04 10:28:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:35,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:35,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:35,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:35,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:35,852 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:35,886 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2025-03-04 10:28:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:28:35,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 10:28:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:35,887 INFO L225 Difference]: With dead ends: 124 [2025-03-04 10:28:35,887 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 10:28:35,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:28:35,888 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:35,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 196 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 10:28:35,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2025-03-04 10:28:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.32) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 10:28:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-03-04 10:28:35,896 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 18 [2025-03-04 10:28:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:35,897 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-03-04 10:28:35,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-03-04 10:28:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:28:35,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:35,897 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:35,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:28:35,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:35,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2023732562, now seen corresponding path program 1 times [2025-03-04 10:28:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308880720] [2025-03-04 10:28:35,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:35,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:28:35,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:28:35,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:35,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:35,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308880720] [2025-03-04 10:28:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308880720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:35,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:35,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:28:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328831118] [2025-03-04 10:28:35,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:28:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:35,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:28:35,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:35,950 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:35,978 INFO L93 Difference]: Finished difference Result 98 states and 133 transitions. [2025-03-04 10:28:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:28:35,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 10:28:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:35,980 INFO L225 Difference]: With dead ends: 98 [2025-03-04 10:28:35,981 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 10:28:35,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:35,982 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:35,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 10:28:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2025-03-04 10:28:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 10:28:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-03-04 10:28:35,993 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 19 [2025-03-04 10:28:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:35,994 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-03-04 10:28:35,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-03-04 10:28:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:28:35,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:35,994 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:35,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:28:35,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:35,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 727388705, now seen corresponding path program 1 times [2025-03-04 10:28:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677588344] [2025-03-04 10:28:35,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:35,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:35,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:28:36,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:28:36,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677588344] [2025-03-04 10:28:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677588344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:28:36,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479739772] [2025-03-04 10:28:36,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:28:36,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:28:36,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:36,037 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,062 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2025-03-04 10:28:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:28:36,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 10:28:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,063 INFO L225 Difference]: With dead ends: 90 [2025-03-04 10:28:36,063 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 10:28:36,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:36,064 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 10:28:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-04 10:28:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.271186440677966) internal successors, (75), 65 states have internal predecessors, (75), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 10:28:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2025-03-04 10:28:36,072 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 20 [2025-03-04 10:28:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,072 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2025-03-04 10:28:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2025-03-04 10:28:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:28:36,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,073 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:28:36,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1688799997, now seen corresponding path program 1 times [2025-03-04 10:28:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882877336] [2025-03-04 10:28:36,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:28:36,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:28:36,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882877336] [2025-03-04 10:28:36,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882877336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261189607] [2025-03-04 10:28:36,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:36,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:36,099 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,108 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2025-03-04 10:28:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-04 10:28:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,109 INFO L225 Difference]: With dead ends: 87 [2025-03-04 10:28:36,109 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 10:28:36,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:36,110 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 10:28:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 10:28:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 64 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 10:28:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2025-03-04 10:28:36,124 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 20 [2025-03-04 10:28:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,124 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2025-03-04 10:28:36,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2025-03-04 10:28:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:28:36,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,125 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:28:36,125 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1074213369, now seen corresponding path program 1 times [2025-03-04 10:28:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688190469] [2025-03-04 10:28:36,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:28:36,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:28:36,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688190469] [2025-03-04 10:28:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688190469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138831091] [2025-03-04 10:28:36,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:36,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:36,154 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,163 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2025-03-04 10:28:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 10:28:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,164 INFO L225 Difference]: With dead ends: 86 [2025-03-04 10:28:36,165 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 10:28:36,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:36,166 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 10:28:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 10:28:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 60 states have internal predecessors, (67), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 10:28:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2025-03-04 10:28:36,175 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 21 [2025-03-04 10:28:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,175 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2025-03-04 10:28:36,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2025-03-04 10:28:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:28:36,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,176 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:28:36,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -568282190, now seen corresponding path program 1 times [2025-03-04 10:28:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-04 10:28:36,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:28:36,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:28:36,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:36,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-04 10:28:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992881199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334868403] [2025-03-04 10:28:36,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:36,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:36,224 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,277 INFO L93 Difference]: Finished difference Result 163 states and 218 transitions. [2025-03-04 10:28:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:28:36,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 10:28:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,280 INFO L225 Difference]: With dead ends: 163 [2025-03-04 10:28:36,280 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 10:28:36,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:28:36,281 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 10:28:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-03-04 10:28:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.2) internal successors, (72), 67 states have internal predecessors, (72), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2025-03-04 10:28:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-03-04 10:28:36,292 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 25 [2025-03-04 10:28:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,292 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-03-04 10:28:36,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2025-03-04 10:28:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:28:36,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,293 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:28:36,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash -587810446, now seen corresponding path program 1 times [2025-03-04 10:28:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446381363] [2025-03-04 10:28:36,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:28:36,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:28:36,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:28:36,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446381363] [2025-03-04 10:28:36,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446381363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:36,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550990665] [2025-03-04 10:28:36,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:36,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:36,351 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,387 INFO L93 Difference]: Finished difference Result 173 states and 223 transitions. [2025-03-04 10:28:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:28:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-04 10:28:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,388 INFO L225 Difference]: With dead ends: 173 [2025-03-04 10:28:36,388 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 10:28:36,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:28:36,389 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 195 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 10:28:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2025-03-04 10:28:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-04 10:28:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2025-03-04 10:28:36,400 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2025-03-04 10:28:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,401 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2025-03-04 10:28:36,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2025-03-04 10:28:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:28:36,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,402 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:28:36,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 155152759, now seen corresponding path program 1 times [2025-03-04 10:28:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190637284] [2025-03-04 10:28:36,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:28:36,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:28:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 10:28:36,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190637284] [2025-03-04 10:28:36,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190637284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:36,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721595202] [2025-03-04 10:28:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:36,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:36,436 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,445 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2025-03-04 10:28:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-04 10:28:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,446 INFO L225 Difference]: With dead ends: 96 [2025-03-04 10:28:36,446 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 10:28:36,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:36,446 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-03-04 10:28:36,446 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-03-04 10:28:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 10:28:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 10:28:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 71 states have internal predecessors, (75), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-04 10:28:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2025-03-04 10:28:36,454 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 38 [2025-03-04 10:28:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,455 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2025-03-04 10:28:36,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2025-03-04 10:28:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 10:28:36,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,456 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:28:36,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash -902414119, now seen corresponding path program 1 times [2025-03-04 10:28:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707829060] [2025-03-04 10:28:36,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:28:36,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:28:36,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:28:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707829060] [2025-03-04 10:28:36,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707829060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:28:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105328894] [2025-03-04 10:28:36,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:28:36,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:28:36,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:36,495 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,511 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2025-03-04 10:28:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:28:36,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-04 10:28:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,512 INFO L225 Difference]: With dead ends: 102 [2025-03-04 10:28:36,512 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:28:36,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:36,513 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:28:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 10:28:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 75 states have internal predecessors, (81), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-04 10:28:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2025-03-04 10:28:36,522 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 34 [2025-03-04 10:28:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,522 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2025-03-04 10:28:36,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2025-03-04 10:28:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:28:36,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,524 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:28:36,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash 92583412, now seen corresponding path program 1 times [2025-03-04 10:28:36,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389694609] [2025-03-04 10:28:36,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:28:36,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:28:36,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:28:36,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389694609] [2025-03-04 10:28:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389694609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:36,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129858460] [2025-03-04 10:28:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:36,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:36,571 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,608 INFO L93 Difference]: Finished difference Result 111 states and 132 transitions. [2025-03-04 10:28:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:28:36,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-03-04 10:28:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,613 INFO L225 Difference]: With dead ends: 111 [2025-03-04 10:28:36,613 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 10:28:36,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:28:36,614 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 10:28:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2025-03-04 10:28:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 74 states have internal predecessors, (79), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-04 10:28:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2025-03-04 10:28:36,624 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 48 [2025-03-04 10:28:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,624 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2025-03-04 10:28:36,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2025-03-04 10:28:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:28:36,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,625 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:28:36,625 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:36,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash -358318835, now seen corresponding path program 1 times [2025-03-04 10:28:36,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:36,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669528318] [2025-03-04 10:28:36,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:36,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:28:36,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:28:36,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:28:36,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669528318] [2025-03-04 10:28:36,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669528318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982601146] [2025-03-04 10:28:36,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:36,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:36,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:36,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:28:36,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:28:36,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:28:36,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:36,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:36,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:28:36,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:28:36,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:28:36,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982601146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:36,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:28:36,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-04 10:28:36,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400566477] [2025-03-04 10:28:36,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:36,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:36,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:36,811 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:36,867 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2025-03-04 10:28:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:28:36,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-04 10:28:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:36,869 INFO L225 Difference]: With dead ends: 101 [2025-03-04 10:28:36,870 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 10:28:36,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:28:36,871 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:36,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 173 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 10:28:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-04 10:28:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2025-03-04 10:28:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2025-03-04 10:28:36,879 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 42 [2025-03-04 10:28:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:36,880 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2025-03-04 10:28:36,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2025-03-04 10:28:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:28:36,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:36,881 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:36,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:28:37,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:28:37,086 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:37,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -486731144, now seen corresponding path program 1 times [2025-03-04 10:28:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:37,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122149533] [2025-03-04 10:28:37,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:37,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:28:37,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:28:37,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:37,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 10:28:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122149533] [2025-03-04 10:28:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122149533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349874180] [2025-03-04 10:28:37,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:37,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:37,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:37,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:37,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:28:37,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:28:37,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:28:37,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:37,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:37,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:28:37,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 10:28:37,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:28:37,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349874180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:37,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:28:37,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-04 10:28:37,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908285582] [2025-03-04 10:28:37,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:37,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:37,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:37,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:37,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:37,250 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:37,357 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2025-03-04 10:28:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:28:37,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2025-03-04 10:28:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:37,358 INFO L225 Difference]: With dead ends: 128 [2025-03-04 10:28:37,358 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 10:28:37,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:28:37,359 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:37,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 173 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 10:28:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-04 10:28:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.098901098901099) internal successors, (100), 93 states have internal predecessors, (100), 21 states have call successors, (21), 8 states have call predecessors, (21), 11 states have return successors, (31), 24 states have call predecessors, (31), 20 states have call successors, (31) [2025-03-04 10:28:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2025-03-04 10:28:37,370 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 54 [2025-03-04 10:28:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:37,371 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2025-03-04 10:28:37,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2025-03-04 10:28:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:28:37,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:37,371 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:37,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:37,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:28:37,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:37,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2128701272, now seen corresponding path program 1 times [2025-03-04 10:28:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045197510] [2025-03-04 10:28:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:37,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:28:37,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:28:37,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:37,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:28:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045197510] [2025-03-04 10:28:37,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045197510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095057676] [2025-03-04 10:28:37,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:37,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:37,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:37,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:37,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:28:37,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:28:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:28:37,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:37,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:37,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:28:37,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:28:37,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:28:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095057676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:37,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:28:37,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-03-04 10:28:37,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270560066] [2025-03-04 10:28:37,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:37,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:28:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:37,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:28:37,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:28:37,768 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:37,817 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2025-03-04 10:28:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:28:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2025-03-04 10:28:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:37,818 INFO L225 Difference]: With dead ends: 155 [2025-03-04 10:28:37,818 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 10:28:37,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:28:37,819 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:37,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 10:28:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2025-03-04 10:28:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 111 states have (on average 1.0990990990990992) internal successors, (122), 113 states have internal predecessors, (122), 26 states have call successors, (26), 9 states have call predecessors, (26), 13 states have return successors, (39), 30 states have call predecessors, (39), 25 states have call successors, (39) [2025-03-04 10:28:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 187 transitions. [2025-03-04 10:28:37,830 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 187 transitions. Word has length 47 [2025-03-04 10:28:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:37,830 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 187 transitions. [2025-03-04 10:28:37,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:28:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 187 transitions. [2025-03-04 10:28:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:28:37,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:37,831 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:37,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:28:38,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:38,035 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:38,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:38,035 INFO L85 PathProgramCache]: Analyzing trace with hash -132589572, now seen corresponding path program 1 times [2025-03-04 10:28:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077727032] [2025-03-04 10:28:38,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:38,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:38,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:28:38,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:28:38,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:38,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 10:28:38,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:38,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077727032] [2025-03-04 10:28:38,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077727032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:38,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51265909] [2025-03-04 10:28:38,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:38,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:38,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:38,099 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:38,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:28:38,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:28:38,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:28:38,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:38,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:38,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:28:38,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 10:28:38,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 10:28:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51265909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:38,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:28:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316900272] [2025-03-04 10:28:38,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:38,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:28:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:38,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:28:38,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:28:38,280 INFO L87 Difference]: Start difference. First operand 153 states and 187 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:28:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:38,315 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2025-03-04 10:28:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:28:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2025-03-04 10:28:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:38,316 INFO L225 Difference]: With dead ends: 175 [2025-03-04 10:28:38,316 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 10:28:38,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:28:38,317 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:38,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 245 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 10:28:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-04 10:28:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.089430894308943) internal successors, (134), 125 states have internal predecessors, (134), 26 states have call successors, (26), 9 states have call predecessors, (26), 16 states have return successors, (42), 33 states have call predecessors, (42), 25 states have call successors, (42) [2025-03-04 10:28:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2025-03-04 10:28:38,331 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 60 [2025-03-04 10:28:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:38,331 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2025-03-04 10:28:38,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:28:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2025-03-04 10:28:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 10:28:38,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:38,332 INFO L218 NwaCegarLoop]: trace histogram [11, 8, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:38,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:28:38,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:28:38,533 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:38,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:38,533 INFO L85 PathProgramCache]: Analyzing trace with hash 868391825, now seen corresponding path program 2 times [2025-03-04 10:28:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636657564] [2025-03-04 10:28:38,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:38,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-04 10:28:38,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 10:28:38,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:38,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-04 10:28:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636657564] [2025-03-04 10:28:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636657564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:28:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733759736] [2025-03-04 10:28:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:28:38,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:38,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:28:38,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:28:38,633 INFO L87 Difference]: Start difference. First operand 168 states and 202 transitions. Second operand has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:38,691 INFO L93 Difference]: Finished difference Result 169 states and 202 transitions. [2025-03-04 10:28:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:28:38,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 84 [2025-03-04 10:28:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:38,693 INFO L225 Difference]: With dead ends: 169 [2025-03-04 10:28:38,693 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 10:28:38,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:28:38,694 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:38,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 154 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 10:28:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-03-04 10:28:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 123 states have (on average 1.08130081300813) internal successors, (133), 124 states have internal predecessors, (133), 26 states have call successors, (26), 9 states have call predecessors, (26), 16 states have return successors, (42), 33 states have call predecessors, (42), 25 states have call successors, (42) [2025-03-04 10:28:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 201 transitions. [2025-03-04 10:28:38,705 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 201 transitions. Word has length 84 [2025-03-04 10:28:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:38,706 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 201 transitions. [2025-03-04 10:28:38,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 201 transitions. [2025-03-04 10:28:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 10:28:38,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:38,708 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:38,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:28:38,708 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:38,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1294870866, now seen corresponding path program 1 times [2025-03-04 10:28:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:38,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778711864] [2025-03-04 10:28:38,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:38,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 10:28:38,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 10:28:38,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:38,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 52 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 10:28:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778711864] [2025-03-04 10:28:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778711864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941564708] [2025-03-04 10:28:38,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:38,834 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:38,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:28:38,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 10:28:38,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 10:28:38,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:38,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:38,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:28:38,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 216 proven. 28 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 10:28:38,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 52 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 10:28:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941564708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:39,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-03-04 10:28:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493346421] [2025-03-04 10:28:39,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:39,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:28:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:39,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:28:39,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:28:39,125 INFO L87 Difference]: Start difference. First operand 167 states and 201 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-04 10:28:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:39,206 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2025-03-04 10:28:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:28:39,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 106 [2025-03-04 10:28:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:39,208 INFO L225 Difference]: With dead ends: 272 [2025-03-04 10:28:39,208 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 10:28:39,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 206 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:28:39,209 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:39,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 10:28:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-03-04 10:28:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 71 states have internal predecessors, (73), 12 states have call successors, (12), 7 states have call predecessors, (12), 12 states have return successors, (18), 15 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-04 10:28:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-03-04 10:28:39,217 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 106 [2025-03-04 10:28:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:39,217 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-03-04 10:28:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-04 10:28:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-03-04 10:28:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 10:28:39,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:39,218 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 13, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 10:28:39,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:28:39,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:39,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:28:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1857295841, now seen corresponding path program 2 times [2025-03-04 10:28:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025959623] [2025-03-04 10:28:39,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:39,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:39,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 10:28:39,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 10:28:39,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:39,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 60 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-04 10:28:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025959623] [2025-03-04 10:28:39,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025959623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626068517] [2025-03-04 10:28:39,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:39,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:39,610 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:39,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:28:39,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-04 10:28:39,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 10:28:39,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:39,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:28:39,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 60 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-04 10:28:39,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 60 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-04 10:28:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626068517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:40,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2025-03-04 10:28:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895793174] [2025-03-04 10:28:40,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:40,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:28:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:28:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:40,115 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:28:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:40,243 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2025-03-04 10:28:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:28:40,244 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 180 [2025-03-04 10:28:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:40,244 INFO L225 Difference]: With dead ends: 104 [2025-03-04 10:28:40,244 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:28:40,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 352 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:28:40,245 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:40,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 206 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:28:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:28:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:28:40,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2025-03-04 10:28:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:40,246 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:28:40,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 6 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:28:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:28:40,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:28:40,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-04 10:28:40,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-04 10:28:40,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-04 10:28:40,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:40,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:40,452 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:40,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:28:40,994 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:28:40,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:28:40 BoogieIcfgContainer [2025-03-04 10:28:40,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:28:40,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:28:40,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:28:40,998 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:28:40,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:35" (3/4) ... [2025-03-04 10:28:41,000 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:28:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec1 [2025-03-04 10:28:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec2 [2025-03-04 10:28:41,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 10:28:41,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:28:41,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:28:41,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:28:41,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:28:41,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:28:41,057 INFO L158 Benchmark]: Toolchain (without parser) took 6380.01ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 113.6MB in the beginning and 214.9MB in the end (delta: -101.3MB). Peak memory consumption was 169.3MB. Max. memory is 16.1GB. [2025-03-04 10:28:41,058 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:28:41,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.63ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 103.4MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:28:41,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.61ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.4MB in the end (delta: 998.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:28:41,059 INFO L158 Benchmark]: Boogie Preprocessor took 21.29ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.9MB in the end (delta: 507.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:28:41,059 INFO L158 Benchmark]: IcfgBuilder took 217.83ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:28:41,059 INFO L158 Benchmark]: TraceAbstraction took 5915.07ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 89.7MB in the beginning and 219.1MB in the end (delta: -129.4MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2025-03-04 10:28:41,059 INFO L158 Benchmark]: Witness Printer took 58.38ms. Allocated memory is still 419.4MB. Free memory was 219.1MB in the beginning and 214.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:28:41,061 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.17ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.63ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 103.4MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.61ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.4MB in the end (delta: 998.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.29ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.9MB in the end (delta: 507.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 217.83ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.7MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5915.07ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 89.7MB in the beginning and 219.1MB in the end (delta: -129.4MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. * Witness Printer took 58.38ms. Allocated memory is still 419.4MB. Free memory was 219.1MB in the beginning and 214.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 21, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 3066 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2224 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 753 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 842 mSDtfsCounter, 753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 958 GetRequests, 825 SyntacticMatches, 11 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=18, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 86 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1372 NumberOfCodeBlocks, 1372 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1688 ConstructedInterpolants, 0 QuantifiedInterpolants, 2464 SizeOfPredicates, 6 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 3468/4100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:28:41,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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