./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba821d92d2796d52ea5c7f089d2638cf5b82e930c6cce78adee479c044ea4833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:21:38,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:21:38,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:21:38,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:21:38,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:21:38,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:21:38,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:21:38,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:21:38,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:21:38,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:21:38,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:21:38,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:21:38,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:21:38,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:21:38,283 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:21:38,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:21:38,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:21:38,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:21:38,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:21:38,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:21:38,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:21:38,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:21:38,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:21:38,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:21:38,285 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:21:38,286 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba821d92d2796d52ea5c7f089d2638cf5b82e930c6cce78adee479c044ea4833 [2025-03-08 15:21:38,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:21:38,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:21:38,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:21:38,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:21:38,525 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:21:38,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i [2025-03-08 15:21:39,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e658f1202/e5f1aa1129bb401fa900093cfc622870/FLAG6b656e76b [2025-03-08 15:21:39,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:21:39,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i [2025-03-08 15:21:40,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e658f1202/e5f1aa1129bb401fa900093cfc622870/FLAG6b656e76b [2025-03-08 15:21:40,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e658f1202/e5f1aa1129bb401fa900093cfc622870 [2025-03-08 15:21:40,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:21:40,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:21:40,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:21:40,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:21:40,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:21:40,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40, skipping insertion in model container [2025-03-08 15:21:40,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:21:40,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i[916,929] [2025-03-08 15:21:40,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:21:40,281 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:21:40,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-37.i[916,929] [2025-03-08 15:21:40,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:21:40,369 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:21:40,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40 WrapperNode [2025-03-08 15:21:40,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:21:40,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:21:40,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:21:40,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:21:40,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,447 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 385 [2025-03-08 15:21:40,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:21:40,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:21:40,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:21:40,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:21:40,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,494 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:21:40,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:21:40,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:21:40,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:21:40,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:21:40,544 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (1/1) ... [2025-03-08 15:21:40,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:21:40,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:21:40,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:21:40,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:21:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:21:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:21:40,589 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:21:40,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:21:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:21:40,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:21:40,674 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:21:40,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:21:41,251 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L336: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1; [2025-03-08 15:21:41,300 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-08 15:21:41,301 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:21:41,317 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:21:41,319 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:21:41,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:21:41 BoogieIcfgContainer [2025-03-08 15:21:41,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:21:41,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:21:41,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:21:41,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:21:41,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:21:40" (1/3) ... [2025-03-08 15:21:41,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7224764c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:21:41, skipping insertion in model container [2025-03-08 15:21:41,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:40" (2/3) ... [2025-03-08 15:21:41,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7224764c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:21:41, skipping insertion in model container [2025-03-08 15:21:41,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:21:41" (3/3) ... [2025-03-08 15:21:41,326 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-37.i [2025-03-08 15:21:41,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:21:41,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-37.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:21:41,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:21:41,382 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;@16c58829, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:21:41,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:21:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 108 states have internal predecessors, (156), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:21:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:41,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:41,425 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:41,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:41,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:41,430 INFO L85 PathProgramCache]: Analyzing trace with hash -522544107, now seen corresponding path program 1 times [2025-03-08 15:21:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:41,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189777709] [2025-03-08 15:21:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:41,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:41,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:41,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:41,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:41,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:21:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189777709] [2025-03-08 15:21:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189777709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:21:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218591385] [2025-03-08 15:21:41,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:41,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:21:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:21:41,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:21:41,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:21:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:42,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:42,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:42,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:42,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:21:42,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:21:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:21:42,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:21:42,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218591385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:42,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:21:42,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:21:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884977760] [2025-03-08 15:21:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:42,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:21:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:42,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:21:42,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:21:42,093 INFO L87 Difference]: Start difference. First operand has 161 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 108 states have internal predecessors, (156), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:21:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:42,131 INFO L93 Difference]: Finished difference Result 316 states and 562 transitions. [2025-03-08 15:21:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:21:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 333 [2025-03-08 15:21:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:42,140 INFO L225 Difference]: With dead ends: 316 [2025-03-08 15:21:42,140 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 15:21:42,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:21:42,144 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:42,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:21:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 15:21:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-08 15:21:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.438095238095238) internal successors, (151), 105 states have internal predecessors, (151), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:21:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 253 transitions. [2025-03-08 15:21:42,195 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 253 transitions. Word has length 333 [2025-03-08 15:21:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:42,196 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 253 transitions. [2025-03-08 15:21:42,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:21:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 253 transitions. [2025-03-08 15:21:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:42,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:42,205 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:42,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:21:42,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:21:42,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:42,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1694187790, now seen corresponding path program 1 times [2025-03-08 15:21:42,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:42,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289033053] [2025-03-08 15:21:42,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:42,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:42,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:42,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:42,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:21:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289033053] [2025-03-08 15:21:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289033053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:42,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:21:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525968889] [2025-03-08 15:21:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:21:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:42,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:21:42,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:42,764 INFO L87 Difference]: Start difference. First operand 158 states and 253 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:42,862 INFO L93 Difference]: Finished difference Result 466 states and 749 transitions. [2025-03-08 15:21:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:21:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-08 15:21:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:42,869 INFO L225 Difference]: With dead ends: 466 [2025-03-08 15:21:42,870 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 15:21:42,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:42,873 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 246 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:42,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 723 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:21:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 15:21:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2025-03-08 15:21:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 204 states have (on average 1.4313725490196079) internal successors, (292), 204 states have internal predecessors, (292), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 15:21:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 496 transitions. [2025-03-08 15:21:42,930 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 496 transitions. Word has length 333 [2025-03-08 15:21:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:42,932 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 496 transitions. [2025-03-08 15:21:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 496 transitions. [2025-03-08 15:21:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:42,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:42,936 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:42,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:21:42,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1343387853, now seen corresponding path program 1 times [2025-03-08 15:21:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865443886] [2025-03-08 15:21:42,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:42,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:43,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:21:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865443886] [2025-03-08 15:21:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865443886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:43,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:21:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718809841] [2025-03-08 15:21:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:43,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:21:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:43,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:21:43,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:21:43,741 INFO L87 Difference]: Start difference. First operand 309 states and 496 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:21:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:44,348 INFO L93 Difference]: Finished difference Result 1005 states and 1599 transitions. [2025-03-08 15:21:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:21:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-03-08 15:21:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:44,357 INFO L225 Difference]: With dead ends: 1005 [2025-03-08 15:21:44,357 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 15:21:44,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:21:44,360 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 867 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:44,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 816 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:21:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 15:21:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 627. [2025-03-08 15:21:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 414 states have (on average 1.4154589371980677) internal successors, (586), 414 states have internal predecessors, (586), 204 states have call successors, (204), 8 states have call predecessors, (204), 8 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-08 15:21:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 994 transitions. [2025-03-08 15:21:44,485 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 994 transitions. Word has length 333 [2025-03-08 15:21:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:44,485 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 994 transitions. [2025-03-08 15:21:44,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:21:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 994 transitions. [2025-03-08 15:21:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:44,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:44,489 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:44,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:21:44,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:44,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2107107572, now seen corresponding path program 1 times [2025-03-08 15:21:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220819253] [2025-03-08 15:21:44,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:44,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:44,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:44,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:44,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:44,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:21:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220819253] [2025-03-08 15:21:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220819253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:21:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170369473] [2025-03-08 15:21:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:44,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:21:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:44,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:21:44,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:21:44,999 INFO L87 Difference]: Start difference. First operand 627 states and 994 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:45,247 INFO L93 Difference]: Finished difference Result 1845 states and 2881 transitions. [2025-03-08 15:21:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:21:45,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-08 15:21:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:45,254 INFO L225 Difference]: With dead ends: 1845 [2025-03-08 15:21:45,254 INFO L226 Difference]: Without dead ends: 1221 [2025-03-08 15:21:45,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:21:45,256 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 192 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:45,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 712 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:21:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-08 15:21:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 981. [2025-03-08 15:21:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 712 states have (on average 1.4438202247191012) internal successors, (1028), 716 states have internal predecessors, (1028), 252 states have call successors, (252), 16 states have call predecessors, (252), 16 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-08 15:21:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1532 transitions. [2025-03-08 15:21:45,360 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1532 transitions. Word has length 333 [2025-03-08 15:21:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:45,361 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1532 transitions. [2025-03-08 15:21:45,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1532 transitions. [2025-03-08 15:21:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:45,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:45,364 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:21:45,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1110035219, now seen corresponding path program 1 times [2025-03-08 15:21:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033432153] [2025-03-08 15:21:45,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:45,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:45,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:45,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:45,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:21:45,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033432153] [2025-03-08 15:21:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033432153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:21:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801770888] [2025-03-08 15:21:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:45,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:21:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:45,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:21:45,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:45,500 INFO L87 Difference]: Start difference. First operand 981 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:45,664 INFO L93 Difference]: Finished difference Result 2921 states and 4570 transitions. [2025-03-08 15:21:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:21:45,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-08 15:21:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:45,675 INFO L225 Difference]: With dead ends: 2921 [2025-03-08 15:21:45,675 INFO L226 Difference]: Without dead ends: 1943 [2025-03-08 15:21:45,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:45,679 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 242 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:45,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 526 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:21:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-03-08 15:21:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1941. [2025-03-08 15:21:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1404 states have (on average 1.4387464387464388) internal successors, (2020), 1412 states have internal predecessors, (2020), 504 states have call successors, (504), 32 states have call predecessors, (504), 32 states have return successors, (504), 496 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-08 15:21:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3028 transitions. [2025-03-08 15:21:45,904 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 3028 transitions. Word has length 333 [2025-03-08 15:21:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:45,905 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 3028 transitions. [2025-03-08 15:21:45,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 3028 transitions. [2025-03-08 15:21:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:45,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:45,909 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:45,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:21:45,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -967174124, now seen corresponding path program 1 times [2025-03-08 15:21:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49620660] [2025-03-08 15:21:45,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:45,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:21:46,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:46,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49620660] [2025-03-08 15:21:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49620660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:46,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:46,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:21:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849911162] [2025-03-08 15:21:46,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:46,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:21:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:46,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:21:46,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:46,221 INFO L87 Difference]: Start difference. First operand 1941 states and 3028 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:46,412 INFO L93 Difference]: Finished difference Result 5074 states and 7920 transitions. [2025-03-08 15:21:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:21:46,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-08 15:21:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:46,429 INFO L225 Difference]: With dead ends: 5074 [2025-03-08 15:21:46,430 INFO L226 Difference]: Without dead ends: 3136 [2025-03-08 15:21:46,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:46,437 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 138 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:46,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 535 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:21:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-03-08 15:21:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3070. [2025-03-08 15:21:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2210 states have (on average 1.4389140271493213) internal successors, (3180), 2222 states have internal predecessors, (3180), 807 states have call successors, (807), 52 states have call predecessors, (807), 52 states have return successors, (807), 795 states have call predecessors, (807), 807 states have call successors, (807) [2025-03-08 15:21:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4794 transitions. [2025-03-08 15:21:46,713 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4794 transitions. Word has length 333 [2025-03-08 15:21:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:46,714 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 4794 transitions. [2025-03-08 15:21:46,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4794 transitions. [2025-03-08 15:21:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:46,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:46,717 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:46,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:21:46,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:46,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1648963308, now seen corresponding path program 1 times [2025-03-08 15:21:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273240845] [2025-03-08 15:21:46,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:46,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:46,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:46,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:46,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:21:47,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273240845] [2025-03-08 15:21:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273240845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:47,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:21:47,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696627655] [2025-03-08 15:21:47,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:47,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:21:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:47,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:21:47,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:21:47,357 INFO L87 Difference]: Start difference. First operand 3070 states and 4794 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:47,904 INFO L93 Difference]: Finished difference Result 9314 states and 14451 transitions. [2025-03-08 15:21:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:21:47,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-08 15:21:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:47,940 INFO L225 Difference]: With dead ends: 9314 [2025-03-08 15:21:47,940 INFO L226 Difference]: Without dead ends: 6368 [2025-03-08 15:21:47,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:21:47,953 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 294 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:47,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 762 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:21:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2025-03-08 15:21:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 5276. [2025-03-08 15:21:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 3984 states have (on average 1.448293172690763) internal successors, (5770), 4020 states have internal predecessors, (5770), 1191 states have call successors, (1191), 100 states have call predecessors, (1191), 100 states have return successors, (1191), 1155 states have call predecessors, (1191), 1191 states have call successors, (1191) [2025-03-08 15:21:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 8152 transitions. [2025-03-08 15:21:48,349 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 8152 transitions. Word has length 333 [2025-03-08 15:21:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:48,350 INFO L471 AbstractCegarLoop]: Abstraction has 5276 states and 8152 transitions. [2025-03-08 15:21:48,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 8152 transitions. [2025-03-08 15:21:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:21:48,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:48,357 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:48,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:21:48,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash 76517589, now seen corresponding path program 1 times [2025-03-08 15:21:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089446230] [2025-03-08 15:21:48,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:48,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:48,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:21:48,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:21:48,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:48,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:22:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:15,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089446230] [2025-03-08 15:22:15,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089446230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:22:15,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:22:15,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 15:22:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157394333] [2025-03-08 15:22:15,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:22:15,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:22:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:15,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:22:15,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:22:15,672 INFO L87 Difference]: Start difference. First operand 5276 states and 8152 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:22:19,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:19,322 INFO L93 Difference]: Finished difference Result 14430 states and 22172 transitions. [2025-03-08 15:22:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 15:22:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-03-08 15:22:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:19,372 INFO L225 Difference]: With dead ends: 14430 [2025-03-08 15:22:19,373 INFO L226 Difference]: Without dead ends: 9320 [2025-03-08 15:22:19,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=412, Invalid=920, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 15:22:19,389 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 2553 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2553 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:19,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2553 Valid, 1902 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 15:22:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2025-03-08 15:22:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 8442. [2025-03-08 15:22:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8442 states, 6508 states have (on average 1.4417639827904118) internal successors, (9383), 6562 states have internal predecessors, (9383), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-08 15:22:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8442 states to 8442 states and 12905 transitions. [2025-03-08 15:22:19,867 INFO L78 Accepts]: Start accepts. Automaton has 8442 states and 12905 transitions. Word has length 333 [2025-03-08 15:22:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:19,868 INFO L471 AbstractCegarLoop]: Abstraction has 8442 states and 12905 transitions. [2025-03-08 15:22:19,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:22:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8442 states and 12905 transitions. [2025-03-08 15:22:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:22:19,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:19,875 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:19,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:22:19,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:19,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1176778507, now seen corresponding path program 1 times [2025-03-08 15:22:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:19,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31042981] [2025-03-08 15:22:19,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:19,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:19,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:22:19,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:22:19,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:19,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:22:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31042981] [2025-03-08 15:22:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31042981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:22:20,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:22:20,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:22:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297715524] [2025-03-08 15:22:20,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:22:20,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:22:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:20,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:22:20,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:22:20,316 INFO L87 Difference]: Start difference. First operand 8442 states and 12905 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:22:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:20,971 INFO L93 Difference]: Finished difference Result 12114 states and 18700 transitions. [2025-03-08 15:22:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:22:20,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-08 15:22:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:21,025 INFO L225 Difference]: With dead ends: 12114 [2025-03-08 15:22:21,025 INFO L226 Difference]: Without dead ends: 9262 [2025-03-08 15:22:21,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:22:21,038 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 375 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:21,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1129 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:22:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2025-03-08 15:22:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 8466. [2025-03-08 15:22:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8466 states, 6532 states have (on average 1.4358542559706062) internal successors, (9379), 6586 states have internal predecessors, (9379), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-08 15:22:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 12901 transitions. [2025-03-08 15:22:21,484 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 12901 transitions. Word has length 333 [2025-03-08 15:22:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:21,485 INFO L471 AbstractCegarLoop]: Abstraction has 8466 states and 12901 transitions. [2025-03-08 15:22:21,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:22:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 12901 transitions. [2025-03-08 15:22:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:22:21,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:21,489 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:21,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:22:21,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:21,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2000691754, now seen corresponding path program 1 times [2025-03-08 15:22:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544842319] [2025-03-08 15:22:21,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:21,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:22:21,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:22:21,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:21,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:22:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544842319] [2025-03-08 15:22:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544842319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:22:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:22:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:22:48,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488607914] [2025-03-08 15:22:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:22:48,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:22:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:48,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:22:48,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:22:48,876 INFO L87 Difference]: Start difference. First operand 8466 states and 12901 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:22:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:51,510 INFO L93 Difference]: Finished difference Result 15432 states and 23362 transitions. [2025-03-08 15:22:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 15:22:51,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 333 [2025-03-08 15:22:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:51,556 INFO L225 Difference]: With dead ends: 15432 [2025-03-08 15:22:51,556 INFO L226 Difference]: Without dead ends: 9898 [2025-03-08 15:22:51,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=732, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 15:22:51,575 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2017 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:51,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1698 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 15:22:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2025-03-08 15:22:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 8486. [2025-03-08 15:22:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 6552 states have (on average 1.4381868131868132) internal successors, (9423), 6606 states have internal predecessors, (9423), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-08 15:22:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 12945 transitions. [2025-03-08 15:22:52,164 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 12945 transitions. Word has length 333 [2025-03-08 15:22:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:52,166 INFO L471 AbstractCegarLoop]: Abstraction has 8486 states and 12945 transitions. [2025-03-08 15:22:52,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:22:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 12945 transitions. [2025-03-08 15:22:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-08 15:22:52,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:52,175 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:52,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:22:52,176 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:52,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash -755927273, now seen corresponding path program 1 times [2025-03-08 15:22:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:52,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752474425] [2025-03-08 15:22:52,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:52,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-08 15:22:52,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-08 15:22:52,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:52,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:22:52,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:52,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752474425] [2025-03-08 15:22:52,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752474425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:22:52,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:22:52,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:22:52,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248659537] [2025-03-08 15:22:52,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:22:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:22:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:52,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:22:52,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:22:52,335 INFO L87 Difference]: Start difference. First operand 8486 states and 12945 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:22:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:52,852 INFO L93 Difference]: Finished difference Result 14390 states and 21959 transitions. [2025-03-08 15:22:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:22:52,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 333 [2025-03-08 15:22:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:52,891 INFO L225 Difference]: With dead ends: 14390 [2025-03-08 15:22:52,892 INFO L226 Difference]: Without dead ends: 8864 [2025-03-08 15:22:52,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:22:52,907 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 241 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:52,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 726 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:22:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2025-03-08 15:22:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 8806. [2025-03-08 15:22:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8806 states, 6872 states have (on average 1.4294237485448196) internal successors, (9823), 6926 states have internal predecessors, (9823), 1761 states have call successors, (1761), 172 states have call predecessors, (1761), 172 states have return successors, (1761), 1707 states have call predecessors, (1761), 1761 states have call successors, (1761) [2025-03-08 15:22:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8806 states to 8806 states and 13345 transitions. [2025-03-08 15:22:53,400 INFO L78 Accepts]: Start accepts. Automaton has 8806 states and 13345 transitions. Word has length 333 [2025-03-08 15:22:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:53,402 INFO L471 AbstractCegarLoop]: Abstraction has 8806 states and 13345 transitions. [2025-03-08 15:22:53,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:22:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8806 states and 13345 transitions. [2025-03-08 15:22:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-08 15:22:53,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:53,407 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:53,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:22:53,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:53,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1427955040, now seen corresponding path program 1 times [2025-03-08 15:22:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:53,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206090453] [2025-03-08 15:22:53,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:53,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-08 15:22:54,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-08 15:22:54,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:54,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat