./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:54:51,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:54:51,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 08:54:51,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:54:51,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:54:51,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:54:51,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:54:51,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:54:51,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:54:51,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:54:51,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:54:51,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:54:51,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:54:51,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:54:51,233 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:54:51,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:54:51,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:54:51,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:54:51,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:54:51,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:54:51,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:54:51,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:54:51,234 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:54:51,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:54:51,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:54:51,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:54:51,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:54:51,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:54:51,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:54:51,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:54:51,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:54:51,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:54:51,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:54:51,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:54:51,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:54:51,237 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 [2025-02-08 08:54:51,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:54:51,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:54:51,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:54:51,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:54:51,537 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:54:51,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2025-02-08 08:54:52,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85855361c/e1bb239380f84382a4e1406f6061bcba/FLAG54c2b646e [2025-02-08 08:54:53,094 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:54:53,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2025-02-08 08:54:53,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85855361c/e1bb239380f84382a4e1406f6061bcba/FLAG54c2b646e [2025-02-08 08:54:53,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85855361c/e1bb239380f84382a4e1406f6061bcba [2025-02-08 08:54:53,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:54:53,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:54:53,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:54:53,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:54:53,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:54:53,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f1a273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53, skipping insertion in model container [2025-02-08 08:54:53,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:54:53,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:54:53,319 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:54:53,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:54:53,340 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:54:53,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53 WrapperNode [2025-02-08 08:54:53,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:54:53,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:54:53,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:54:53,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:54:53,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,362 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2025-02-08 08:54:53,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:54:53,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:54:53,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:54:53,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:54:53,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,377 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 08:54:53,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:54:53,386 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:54:53,387 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:54:53,387 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:54:53,388 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (1/1) ... [2025-02-08 08:54:53,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:54:53,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:54:53,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:54:53,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:54:53,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:54:53,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:54:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2025-02-08 08:54:53,451 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2025-02-08 08:54:53,493 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:54:53,495 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:54:53,600 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-08 08:54:53,600 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:54:53,607 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:54:53,607 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:54:53,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:54:53 BoogieIcfgContainer [2025-02-08 08:54:53,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:54:53,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:54:53,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:54:53,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:54:53,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:54:53" (1/3) ... [2025-02-08 08:54:53,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1ed4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:54:53, skipping insertion in model container [2025-02-08 08:54:53,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:54:53" (2/3) ... [2025-02-08 08:54:53,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1ed4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:54:53, skipping insertion in model container [2025-02-08 08:54:53,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:54:53" (3/3) ... [2025-02-08 08:54:53,618 INFO L128 eAbstractionObserver]: Analyzing ICFG McCarthy91_Recursion.c [2025-02-08 08:54:53,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:54:53,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG McCarthy91_Recursion.c that has 2 procedures, 21 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-08 08:54:53,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:54:53,705 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;@71d0fde8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:54:53,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 08:54:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:54:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 08:54:53,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:53,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:54:53,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:53,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 31089814, now seen corresponding path program 1 times [2025-02-08 08:54:53,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:53,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648919260] [2025-02-08 08:54:53,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:53,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:53,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:54:53,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:54:53,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:53,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:54:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648919260] [2025-02-08 08:54:53,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648919260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:54:53,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:54:53,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:54:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176882132] [2025-02-08 08:54:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:54:53,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:54:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:53,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:54:53,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:54:53,886 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 08:54:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:53,926 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-02-08 08:54:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:54:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 08:54:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:53,932 INFO L225 Difference]: With dead ends: 21 [2025-02-08 08:54:53,932 INFO L226 Difference]: Without dead ends: 17 [2025-02-08 08:54:53,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:54:53,936 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:53,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:54:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-08 08:54:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-08 08:54:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 08:54:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-02-08 08:54:53,965 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 5 [2025-02-08 08:54:53,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:53,965 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-02-08 08:54:53,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 08:54:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-02-08 08:54:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 08:54:53,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:53,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:54:53,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:54:53,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:53,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash 31089853, now seen corresponding path program 1 times [2025-02-08 08:54:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:53,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943049265] [2025-02-08 08:54:53,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:53,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:54:53,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:54:53,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:53,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:54:54,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:54,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943049265] [2025-02-08 08:54:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943049265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:54:54,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:54:54,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:54:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355861650] [2025-02-08 08:54:54,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:54:54,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:54:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:54,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:54:54,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:54:54,029 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 08:54:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:54,135 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-02-08 08:54:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:54:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 08:54:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:54,138 INFO L225 Difference]: With dead ends: 34 [2025-02-08 08:54:54,139 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 08:54:54,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-02-08 08:54:54,140 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 36 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:54,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 36 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:54:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 08:54:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2025-02-08 08:54:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 08:54:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-02-08 08:54:54,157 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 5 [2025-02-08 08:54:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:54,157 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-02-08 08:54:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 08:54:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-02-08 08:54:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 08:54:54,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:54,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:54:54,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:54:54,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 963784208, now seen corresponding path program 1 times [2025-02-08 08:54:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706663390] [2025-02-08 08:54:54,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:54,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:54:54,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:54:54,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:54,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:54:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706663390] [2025-02-08 08:54:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706663390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:54:54,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:54:54,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:54:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469203513] [2025-02-08 08:54:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:54:54,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:54:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:54,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:54:54,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:54:54,219 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) 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-02-08 08:54:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:54,303 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-02-08 08:54:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:54:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) 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-02-08 08:54:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:54,306 INFO L225 Difference]: With dead ends: 49 [2025-02-08 08:54:54,306 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 08:54:54,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-02-08 08:54:54,307 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:54,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 42 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:54:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 08:54:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-02-08 08:54:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 08:54:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-02-08 08:54:54,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 6 [2025-02-08 08:54:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:54,320 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-02-08 08:54:54,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) 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-02-08 08:54:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-02-08 08:54:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 08:54:54,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:54,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:54:54,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:54:54,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:54,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash 963785425, now seen corresponding path program 1 times [2025-02-08 08:54:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:54,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959519623] [2025-02-08 08:54:54,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:54,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:54:54,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:54:54,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:54,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:54:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959519623] [2025-02-08 08:54:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959519623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:54:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:54:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:54:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543336914] [2025-02-08 08:54:54,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:54:54,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:54:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:54,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:54:54,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:54:54,362 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. 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-02-08 08:54:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:54,384 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2025-02-08 08:54:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:54:54,385 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-02-08 08:54:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:54,386 INFO L225 Difference]: With dead ends: 40 [2025-02-08 08:54:54,386 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 08:54:54,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:54:54,387 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:54,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:54:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 08:54:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-02-08 08:54:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 08:54:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-08 08:54:54,398 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 6 [2025-02-08 08:54:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:54,398 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-08 08:54:54,398 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-02-08 08:54:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-08 08:54:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:54:54,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:54,399 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:54:54,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:54:54,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1805144379, now seen corresponding path program 1 times [2025-02-08 08:54:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871757831] [2025-02-08 08:54:54,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:54,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:54:54,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:54:54,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:54,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:54:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:54,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871757831] [2025-02-08 08:54:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871757831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:54:54,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:54:54,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:54:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297284281] [2025-02-08 08:54:54,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:54:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:54:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:54,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:54:54,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:54:54,478 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:54:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:54,547 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-02-08 08:54:54,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:54:54,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-02-08 08:54:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:54,549 INFO L225 Difference]: With dead ends: 55 [2025-02-08 08:54:54,549 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 08:54:54,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:54:54,550 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:54,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:54:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 08:54:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2025-02-08 08:54:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 08:54:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-02-08 08:54:54,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 11 [2025-02-08 08:54:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-02-08 08:54:54,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:54:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-02-08 08:54:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:54:54,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:54,564 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:54:54,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:54:54,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1493849350, now seen corresponding path program 1 times [2025-02-08 08:54:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:54,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751031834] [2025-02-08 08:54:54,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:54,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:54:54,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:54:54,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:54,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:54:54,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:54,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751031834] [2025-02-08 08:54:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751031834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:54:54,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:54:54,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:54:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79183988] [2025-02-08 08:54:54,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:54:54,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:54:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:54,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:54:54,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:54:54,667 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-02-08 08:54:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:54,814 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2025-02-08 08:54:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:54:54,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-02-08 08:54:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:54,815 INFO L225 Difference]: With dead ends: 100 [2025-02-08 08:54:54,816 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 08:54:54,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:54:54,817 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:54,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 64 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:54:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 08:54:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-02-08 08:54:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.15) internal successors, (69), 65 states have internal predecessors, (69), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-02-08 08:54:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2025-02-08 08:54:54,850 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 18 [2025-02-08 08:54:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:54,851 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2025-02-08 08:54:54,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-02-08 08:54:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2025-02-08 08:54:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:54:54,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:54,852 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:54:54,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:54:54,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:54,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash 935309171, now seen corresponding path program 1 times [2025-02-08 08:54:54,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:54,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147424065] [2025-02-08 08:54:54,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:54,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:54,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:54:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:54:54,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:54,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:54:54,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147424065] [2025-02-08 08:54:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147424065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:54:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831408896] [2025-02-08 08:54:54,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:54,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:54:54,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:54:54,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:54:54,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:54:54,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:54:55,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:54:55,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:55,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:55,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:54:55,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:54:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:54:55,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:54:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:54:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831408896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:54:55,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:54:55,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2025-02-08 08:54:55,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219904929] [2025-02-08 08:54:55,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:54:55,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 08:54:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:55,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 08:54:55,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-02-08 08:54:55,367 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:54:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:55,929 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2025-02-08 08:54:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 08:54:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2025-02-08 08:54:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:55,931 INFO L225 Difference]: With dead ends: 99 [2025-02-08 08:54:55,931 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 08:54:55,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=462, Invalid=1344, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 08:54:55,932 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 153 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:55,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 33 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:54:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 08:54:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-02-08 08:54:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 64 states have internal predecessors, (67), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-02-08 08:54:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2025-02-08 08:54:55,957 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 19 [2025-02-08 08:54:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:55,957 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2025-02-08 08:54:55,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:54:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2025-02-08 08:54:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 08:54:55,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:54:55,959 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 08:54:55,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:54:56,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:54:56,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 08:54:56,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:54:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1509330999, now seen corresponding path program 1 times [2025-02-08 08:54:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:54:56,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454189330] [2025-02-08 08:54:56,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:54:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:54:56,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 08:54:56,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:54:56,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:54:56,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:54:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:54:56,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:54:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454189330] [2025-02-08 08:54:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454189330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:54:56,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:54:56,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:54:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621466938] [2025-02-08 08:54:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:54:56,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:54:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:54:56,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:54:56,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:54:56,281 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 08:54:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:54:56,415 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2025-02-08 08:54:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:54:56,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-02-08 08:54:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:54:56,416 INFO L225 Difference]: With dead ends: 92 [2025-02-08 08:54:56,416 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:54:56,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:54:56,417 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:54:56,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:54:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:54:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:54:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:54:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:54:56,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2025-02-08 08:54:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:54:56,422 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:54:56,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 08:54:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:54:56,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:54:56,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-08 08:54:56,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-08 08:54:56,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-08 08:54:56,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-08 08:54:56,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:54:56,433 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:54:56,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:54:56,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:54:56,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:54:56 BoogieIcfgContainer [2025-02-08 08:54:56,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:54:56,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:54:56,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:54:56,959 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:54:56,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:54:53" (3/4) ... [2025-02-08 08:54:56,962 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:54:56,966 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mc91 [2025-02-08 08:54:56,969 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:54:56,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:54:56,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:54:57,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:54:57,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:54:57,036 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:54:57,036 INFO L158 Benchmark]: Toolchain (without parser) took 3877.64ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 90.0MB in the end (delta: 23.4MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-02-08 08:54:57,037 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:54:57,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.17ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 103.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:54:57,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.63ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:54:57,038 INFO L158 Benchmark]: Boogie Preprocessor took 21.58ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:54:57,038 INFO L158 Benchmark]: IcfgBuilder took 221.73ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 91.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:54:57,039 INFO L158 Benchmark]: TraceAbstraction took 3348.19ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 96.2MB in the end (delta: -5.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-02-08 08:54:57,039 INFO L158 Benchmark]: Witness Printer took 76.91ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 90.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:54:57,041 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.17ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 103.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.63ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 102.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.58ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 221.73ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 91.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3348.19ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 96.2MB in the end (delta: -5.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Witness Printer took 76.91ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 90.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: 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 2 procedures, 21 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 467 IncrementalHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 123 mSDtfsCounter, 467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=6, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 344 SizeOfPredicates, 3 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 54/68 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:54:57,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE