./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label14.c -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 ada1a27904128215b4edfdaf35827c452e538bc81c43cd0aac0f11f9e4d77236 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:35:38,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:35:38,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:35:38,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:35:38,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:35:38,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:35:38,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:35:38,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:35:38,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:35:38,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:35:38,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:35:38,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:35:38,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:35:38,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:35:38,844 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:35:38,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:35:38,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:35:38,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:35:38,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:35:38,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:35:38,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:35:38,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:35:38,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:35:38,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:35:38,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:35:38,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:35:38,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:35:38,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:35:38,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:35:38,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:35:38,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:35:38,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:35:38,847 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 -> ada1a27904128215b4edfdaf35827c452e538bc81c43cd0aac0f11f9e4d77236 [2025-03-03 10:35:39,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:35:39,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:35:39,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:35:39,101 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:35:39,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:35:39,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label14.c [2025-03-03 10:35:40,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f1b12b3/9872f056cf024b788ea714d508645847/FLAG5319195c0 [2025-03-03 10:35:40,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:35:40,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label14.c [2025-03-03 10:35:40,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f1b12b3/9872f056cf024b788ea714d508645847/FLAG5319195c0 [2025-03-03 10:35:40,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f1b12b3/9872f056cf024b788ea714d508645847 [2025-03-03 10:35:40,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:35:40,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:35:40,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:35:40,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:35:40,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:35:40,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:35:40" (1/1) ... [2025-03-03 10:35:40,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a15ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:40, skipping insertion in model container [2025-03-03 10:35:40,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:35:40" (1/1) ... [2025-03-03 10:35:40,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:35:41,019 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/eca-rers2012/Problem12_label14.c[6042,6055] [2025-03-03 10:35:41,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:35:41,485 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:35:41,515 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/eca-rers2012/Problem12_label14.c[6042,6055] [2025-03-03 10:35:41,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:35:41,835 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:35:41,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41 WrapperNode [2025-03-03 10:35:41,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:35:41,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:35:41,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:35:41,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:35:41,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:41,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,123 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:35:42,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:35:42,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:35:42,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:35:42,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:35:42,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,332 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-03 10:35:42,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:35:42,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:35:42,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:35:42,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:35:42,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (1/1) ... [2025-03-03 10:35:42,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:35:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:42,592 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-03 10:35:42,594 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-03 10:35:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:35:42,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:35:42,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:35:42,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:35:42,666 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:35:42,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:35:45,932 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:35:45,932 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:35:45,932 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:35:46,063 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:35:46,063 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:35:46,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:35:46,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:35:46,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:46 BoogieIcfgContainer [2025-03-03 10:35:46,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:35:46,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:35:46,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:35:46,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:35:46,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:35:40" (1/3) ... [2025-03-03 10:35:46,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe1a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:35:46, skipping insertion in model container [2025-03-03 10:35:46,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:35:41" (2/3) ... [2025-03-03 10:35:46,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe1a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:35:46, skipping insertion in model container [2025-03-03 10:35:46,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:35:46" (3/3) ... [2025-03-03 10:35:46,104 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label14.c [2025-03-03 10:35:46,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:35:46,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label14.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:35:46,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:35:46,193 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;@164be386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:35:46,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:35:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 10:35:46,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:46,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:46,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:46,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1146344383, now seen corresponding path program 1 times [2025-03-03 10:35:46,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:46,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104360209] [2025-03-03 10:35:46,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:46,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 10:35:46,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 10:35:46,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:35:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104360209] [2025-03-03 10:35:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104360209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:46,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528245025] [2025-03-03 10:35:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:46,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:35:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:46,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:35:46,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:46,680 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:51,833 INFO L93 Difference]: Finished difference Result 3142 states and 6126 transitions. [2025-03-03 10:35:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:35:51,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 10:35:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:51,852 INFO L225 Difference]: With dead ends: 3142 [2025-03-03 10:35:51,852 INFO L226 Difference]: Without dead ends: 2257 [2025-03-03 10:35:51,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03 10:35:51,861 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 2225 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5499 mSolverCounterSat, 1273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2225 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 6772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1273 IncrementalHoareTripleChecker+Valid, 5499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:51,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2225 Valid, 765 Invalid, 6772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1273 Valid, 5499 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-03 10:35:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-03 10:35:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-03-03 10:35:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5749113475177305) internal successors, (3553), 2256 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3553 transitions. [2025-03-03 10:35:51,958 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3553 transitions. Word has length 48 [2025-03-03 10:35:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:51,958 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3553 transitions. [2025-03-03 10:35:51,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3553 transitions. [2025-03-03 10:35:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 10:35:51,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:51,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:51,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:35:51,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:51,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1161994173, now seen corresponding path program 1 times [2025-03-03 10:35:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:51,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100034774] [2025-03-03 10:35:51,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:51,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 10:35:52,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 10:35:52,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:52,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:35:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100034774] [2025-03-03 10:35:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100034774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:52,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:52,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341737237] [2025-03-03 10:35:52,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:52,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:35:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:52,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:35:52,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:52,274 INFO L87 Difference]: Start difference. First operand 2257 states and 3553 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:55,358 INFO L93 Difference]: Finished difference Result 6051 states and 9916 transitions. [2025-03-03 10:35:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:35:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-03 10:35:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:55,369 INFO L225 Difference]: With dead ends: 6051 [2025-03-03 10:35:55,369 INFO L226 Difference]: Without dead ends: 3759 [2025-03-03 10:35:55,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03 10:35:55,371 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:55,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 692 Invalid, 4443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:35:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-03-03 10:35:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3008. [2025-03-03 10:35:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4319920186232125) internal successors, (4306), 3007 states have internal predecessors, (4306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4306 transitions. [2025-03-03 10:35:55,414 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4306 transitions. Word has length 119 [2025-03-03 10:35:55,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:55,414 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4306 transitions. [2025-03-03 10:35:55,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4306 transitions. [2025-03-03 10:35:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 10:35:55,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:55,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:55,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:35:55,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:55,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1511716499, now seen corresponding path program 1 times [2025-03-03 10:35:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904498534] [2025-03-03 10:35:55,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:55,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 10:35:55,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 10:35:55,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:55,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 54 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 10:35:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904498534] [2025-03-03 10:35:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904498534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:55,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564852285] [2025-03-03 10:35:55,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:55,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:55,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:55,971 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-03 10:35:55,974 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-03 10:35:56,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 10:35:56,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 10:35:56,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:56,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:56,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:35:56,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:35:56,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:35:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564852285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:56,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:35:56,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:35:56,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463013576] [2025-03-03 10:35:56,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:56,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:56,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:56,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:56,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:56,314 INFO L87 Difference]: Start difference. First operand 3008 states and 4306 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:58,369 INFO L93 Difference]: Finished difference Result 8267 states and 11519 transitions. [2025-03-03 10:35:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:58,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-03 10:35:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:58,386 INFO L225 Difference]: With dead ends: 8267 [2025-03-03 10:35:58,386 INFO L226 Difference]: Without dead ends: 5261 [2025-03-03 10:35:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:35:58,391 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:58,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 427 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-03-03 10:35:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5261. [2025-03-03 10:35:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.1982889733840305) internal successors, (6303), 5260 states have internal predecessors, (6303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 6303 transitions. [2025-03-03 10:35:58,473 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 6303 transitions. Word has length 258 [2025-03-03 10:35:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:58,475 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 6303 transitions. [2025-03-03 10:35:58,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:35:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 6303 transitions. [2025-03-03 10:35:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-03 10:35:58,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:58,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:35:58,515 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-03 10:35:58,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:58,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:58,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -672773490, now seen corresponding path program 1 times [2025-03-03 10:35:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183357260] [2025-03-03 10:35:58,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:58,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 10:35:58,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 10:35:58,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:58,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:35:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183357260] [2025-03-03 10:35:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183357260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301441570] [2025-03-03 10:35:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:59,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:35:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:59,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:35:59,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:35:59,060 INFO L87 Difference]: Start difference. First operand 5261 states and 6303 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:01,737 INFO L93 Difference]: Finished difference Result 12061 states and 15068 transitions. [2025-03-03 10:36:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-03-03 10:36:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:01,752 INFO L225 Difference]: With dead ends: 12061 [2025-03-03 10:36:01,752 INFO L226 Difference]: Without dead ends: 7516 [2025-03-03 10:36:01,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03 10:36:01,757 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 775 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:01,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 327 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:36:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2025-03-03 10:36:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7514. [2025-03-03 10:36:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7514 states, 7513 states have (on average 1.1812857713296951) internal successors, (8875), 7513 states have internal predecessors, (8875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 8875 transitions. [2025-03-03 10:36:01,856 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 8875 transitions. Word has length 260 [2025-03-03 10:36:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:01,856 INFO L471 AbstractCegarLoop]: Abstraction has 7514 states and 8875 transitions. [2025-03-03 10:36:01,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 8875 transitions. [2025-03-03 10:36:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-03 10:36:01,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:01,860 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:36:01,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:36:01,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1951001517, now seen corresponding path program 1 times [2025-03-03 10:36:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:01,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701392991] [2025-03-03 10:36:01,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:01,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-03 10:36:01,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-03 10:36:01,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:01,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 137 proven. 108 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 10:36:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701392991] [2025-03-03 10:36:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701392991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876898848] [2025-03-03 10:36:02,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:02,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:36:02,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:36:02,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-03 10:36:02,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-03 10:36:02,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:02,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:36:02,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:36:02,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:02,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876898848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:02,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:02,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 10:36:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805138056] [2025-03-03 10:36:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:02,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:02,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:02,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:02,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:02,444 INFO L87 Difference]: Start difference. First operand 7514 states and 8875 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:04,463 INFO L93 Difference]: Finished difference Result 16528 states and 20146 transitions. [2025-03-03 10:36:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:04,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2025-03-03 10:36:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:04,485 INFO L225 Difference]: With dead ends: 16528 [2025-03-03 10:36:04,486 INFO L226 Difference]: Without dead ends: 9767 [2025-03-03 10:36:04,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:04,491 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 789 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:04,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 235 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-03-03 10:36:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-03-03 10:36:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.1859512594716364) internal successors, (11582), 9766 states have internal predecessors, (11582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 11582 transitions. [2025-03-03 10:36:04,602 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 11582 transitions. Word has length 337 [2025-03-03 10:36:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:04,602 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 11582 transitions. [2025-03-03 10:36:04,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 11582 transitions. [2025-03-03 10:36:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-03 10:36:04,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:04,609 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:04,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:36:04,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:04,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:04,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash 204848300, now seen corresponding path program 1 times [2025-03-03 10:36:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:04,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104789176] [2025-03-03 10:36:04,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:04,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-03 10:36:04,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-03 10:36:04,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:04,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 10:36:05,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104789176] [2025-03-03 10:36:05,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104789176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:05,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031369891] [2025-03-03 10:36:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:05,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:05,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:05,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:05,057 INFO L87 Difference]: Start difference. First operand 9767 states and 11582 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:07,445 INFO L93 Difference]: Finished difference Result 27042 states and 32469 transitions. [2025-03-03 10:36:07,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:07,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 375 [2025-03-03 10:36:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:07,478 INFO L225 Difference]: With dead ends: 27042 [2025-03-03 10:36:07,479 INFO L226 Difference]: Without dead ends: 18028 [2025-03-03 10:36:07,488 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-03 10:36:07,489 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 635 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:07,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1266 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:36:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18028 states. [2025-03-03 10:36:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 16526. [2025-03-03 10:36:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16526 states, 16525 states have (on average 1.1817851739788199) internal successors, (19529), 16525 states have internal predecessors, (19529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 19529 transitions. [2025-03-03 10:36:07,670 INFO L78 Accepts]: Start accepts. Automaton has 16526 states and 19529 transitions. Word has length 375 [2025-03-03 10:36:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:07,670 INFO L471 AbstractCegarLoop]: Abstraction has 16526 states and 19529 transitions. [2025-03-03 10:36:07,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states and 19529 transitions. [2025-03-03 10:36:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-03 10:36:07,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:07,677 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:36:07,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:36:07,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:07,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:07,679 INFO L85 PathProgramCache]: Analyzing trace with hash -824365716, now seen corresponding path program 1 times [2025-03-03 10:36:07,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130017488] [2025-03-03 10:36:07,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:07,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-03 10:36:07,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-03 10:36:07,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:07,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 10:36:08,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:08,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130017488] [2025-03-03 10:36:08,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130017488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:08,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:08,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:08,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285450096] [2025-03-03 10:36:08,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:08,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:08,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:08,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:08,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:08,081 INFO L87 Difference]: Start difference. First operand 16526 states and 19529 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:10,236 INFO L93 Difference]: Finished difference Result 45066 states and 53946 transitions. [2025-03-03 10:36:10,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:10,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 376 [2025-03-03 10:36:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:10,274 INFO L225 Difference]: With dead ends: 45066 [2025-03-03 10:36:10,275 INFO L226 Difference]: Without dead ends: 29293 [2025-03-03 10:36:10,288 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-03 10:36:10,289 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 726 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:10,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1345 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29293 states. [2025-03-03 10:36:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29293 to 27791. [2025-03-03 10:36:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27791 states, 27790 states have (on average 1.1431090320259085) internal successors, (31767), 27790 states have internal predecessors, (31767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 31767 transitions. [2025-03-03 10:36:10,552 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 31767 transitions. Word has length 376 [2025-03-03 10:36:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:10,552 INFO L471 AbstractCegarLoop]: Abstraction has 27791 states and 31767 transitions. [2025-03-03 10:36:10,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 31767 transitions. [2025-03-03 10:36:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-03 10:36:10,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:10,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:10,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:36:10,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:10,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash -284795230, now seen corresponding path program 1 times [2025-03-03 10:36:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103386887] [2025-03-03 10:36:10,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:10,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 10:36:10,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 10:36:10,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:10,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:36:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103386887] [2025-03-03 10:36:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103386887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590636190] [2025-03-03 10:36:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:10,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:10,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:10,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:10,738 INFO L87 Difference]: Start difference. First operand 27791 states and 31767 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:13,053 INFO L93 Difference]: Finished difference Result 67596 states and 77873 transitions. [2025-03-03 10:36:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2025-03-03 10:36:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:13,100 INFO L225 Difference]: With dead ends: 67596 [2025-03-03 10:36:13,100 INFO L226 Difference]: Without dead ends: 40558 [2025-03-03 10:36:13,117 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-03 10:36:13,119 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 731 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:13,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 297 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40558 states. [2025-03-03 10:36:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40558 to 38305. [2025-03-03 10:36:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38305 states, 38304 states have (on average 1.14515455304929) internal successors, (43864), 38304 states have internal predecessors, (43864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38305 states to 38305 states and 43864 transitions. [2025-03-03 10:36:13,520 INFO L78 Accepts]: Start accepts. Automaton has 38305 states and 43864 transitions. Word has length 379 [2025-03-03 10:36:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:13,521 INFO L471 AbstractCegarLoop]: Abstraction has 38305 states and 43864 transitions. [2025-03-03 10:36:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 38305 states and 43864 transitions. [2025-03-03 10:36:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 10:36:13,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:13,529 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:13,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:36:13,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:13,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1735683937, now seen corresponding path program 1 times [2025-03-03 10:36:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741867019] [2025-03-03 10:36:13,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:13,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 10:36:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 10:36:13,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:13,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:36:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741867019] [2025-03-03 10:36:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741867019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554111804] [2025-03-03 10:36:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:13,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:13,891 INFO L87 Difference]: Start difference. First operand 38305 states and 43864 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:16,203 INFO L93 Difference]: Finished difference Result 95383 states and 110635 transitions. [2025-03-03 10:36:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 469 [2025-03-03 10:36:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:16,287 INFO L225 Difference]: With dead ends: 95383 [2025-03-03 10:36:16,287 INFO L226 Difference]: Without dead ends: 54827 [2025-03-03 10:36:16,309 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-03 10:36:16,309 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 705 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:16,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1291 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54827 states. [2025-03-03 10:36:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54827 to 54076. [2025-03-03 10:36:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54076 states, 54075 states have (on average 1.124086916319926) internal successors, (60785), 54075 states have internal predecessors, (60785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54076 states to 54076 states and 60785 transitions. [2025-03-03 10:36:16,853 INFO L78 Accepts]: Start accepts. Automaton has 54076 states and 60785 transitions. Word has length 469 [2025-03-03 10:36:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:16,855 INFO L471 AbstractCegarLoop]: Abstraction has 54076 states and 60785 transitions. [2025-03-03 10:36:16,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54076 states and 60785 transitions. [2025-03-03 10:36:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-03 10:36:16,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:16,873 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:16,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:36:16,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:16,874 INFO L85 PathProgramCache]: Analyzing trace with hash -966964413, now seen corresponding path program 1 times [2025-03-03 10:36:16,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:16,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46514827] [2025-03-03 10:36:16,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:16,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:17,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-03 10:36:17,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-03 10:36:17,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-03 10:36:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:17,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46514827] [2025-03-03 10:36:17,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46514827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:17,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136071089] [2025-03-03 10:36:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:17,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:17,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:17,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:17,251 INFO L87 Difference]: Start difference. First operand 54076 states and 60785 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:19,602 INFO L93 Difference]: Finished difference Result 108150 states and 121534 transitions. [2025-03-03 10:36:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:19,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481 [2025-03-03 10:36:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:19,654 INFO L225 Difference]: With dead ends: 108150 [2025-03-03 10:36:19,655 INFO L226 Difference]: Without dead ends: 54827 [2025-03-03 10:36:19,680 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-03 10:36:19,681 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:19,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1225 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54827 states. [2025-03-03 10:36:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54827 to 53325. [2025-03-03 10:36:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.108731528017403) internal successors, (59122), 53324 states have internal predecessors, (59122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 59122 transitions. [2025-03-03 10:36:20,125 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 59122 transitions. Word has length 481 [2025-03-03 10:36:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:20,125 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 59122 transitions. [2025-03-03 10:36:20,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 59122 transitions. [2025-03-03 10:36:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-03 10:36:20,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:20,132 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:36:20,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:20,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1934245349, now seen corresponding path program 1 times [2025-03-03 10:36:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:20,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706946132] [2025-03-03 10:36:20,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:20,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:20,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-03 10:36:20,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-03 10:36:20,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:20,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-03 10:36:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706946132] [2025-03-03 10:36:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706946132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649403160] [2025-03-03 10:36:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:20,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:20,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:20,453 INFO L87 Difference]: Start difference. First operand 53325 states and 59122 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:22,601 INFO L93 Difference]: Finished difference Result 105897 states and 117486 transitions. [2025-03-03 10:36:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:22,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 482 [2025-03-03 10:36:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:22,660 INFO L225 Difference]: With dead ends: 105897 [2025-03-03 10:36:22,660 INFO L226 Difference]: Without dead ends: 53325 [2025-03-03 10:36:22,686 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-03 10:36:22,687 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 700 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:22,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 401 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53325 states. [2025-03-03 10:36:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 53325. [2025-03-03 10:36:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.072950266296602) internal successors, (57214), 53324 states have internal predecessors, (57214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 57214 transitions. [2025-03-03 10:36:23,137 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 57214 transitions. Word has length 482 [2025-03-03 10:36:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:23,137 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 57214 transitions. [2025-03-03 10:36:23,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 57214 transitions. [2025-03-03 10:36:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-03 10:36:23,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:23,144 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:23,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:36:23,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:23,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -830435274, now seen corresponding path program 1 times [2025-03-03 10:36:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:23,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965652435] [2025-03-03 10:36:23,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:23,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-03 10:36:23,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-03 10:36:23,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:23,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-03 10:36:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:23,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965652435] [2025-03-03 10:36:23,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965652435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:23,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:23,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279296292] [2025-03-03 10:36:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:23,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:23,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:23,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:23,557 INFO L87 Difference]: Start difference. First operand 53325 states and 57214 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:26,026 INFO L93 Difference]: Finished difference Result 143447 states and 154445 transitions. [2025-03-03 10:36:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:26,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2025-03-03 10:36:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:26,129 INFO L225 Difference]: With dead ends: 143447 [2025-03-03 10:36:26,129 INFO L226 Difference]: Without dead ends: 90875 [2025-03-03 10:36:26,170 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-03 10:36:26,171 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 690 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:26,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1319 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90875 states. [2025-03-03 10:36:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90875 to 87871. [2025-03-03 10:36:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87871 states, 87870 states have (on average 1.0608057357459884) internal successors, (93213), 87870 states have internal predecessors, (93213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87871 states to 87871 states and 93213 transitions. [2025-03-03 10:36:26,988 INFO L78 Accepts]: Start accepts. Automaton has 87871 states and 93213 transitions. Word has length 488 [2025-03-03 10:36:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:26,988 INFO L471 AbstractCegarLoop]: Abstraction has 87871 states and 93213 transitions. [2025-03-03 10:36:26,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87871 states and 93213 transitions. [2025-03-03 10:36:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-03 10:36:26,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:26,997 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:36:26,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:36:26,997 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:26,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1074514767, now seen corresponding path program 1 times [2025-03-03 10:36:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622482887] [2025-03-03 10:36:26,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 10:36:27,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 10:36:27,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:27,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:36:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622482887] [2025-03-03 10:36:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622482887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:27,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69228124] [2025-03-03 10:36:27,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:27,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:27,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:27,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:27,192 INFO L87 Difference]: Start difference. First operand 87871 states and 93213 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:29,594 INFO L93 Difference]: Finished difference Result 196768 states and 209860 transitions. [2025-03-03 10:36:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 510 [2025-03-03 10:36:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:29,706 INFO L225 Difference]: With dead ends: 196768 [2025-03-03 10:36:29,706 INFO L226 Difference]: Without dead ends: 109650 [2025-03-03 10:36:29,755 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-03 10:36:29,756 INFO L435 NwaCegarLoop]: 1276 mSDtfsCounter, 564 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:29,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1284 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:36:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109650 states. [2025-03-03 10:36:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109650 to 106646. [2025-03-03 10:36:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106646 states, 106645 states have (on average 1.055876975010549) internal successors, (112604), 106645 states have internal predecessors, (112604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106646 states to 106646 states and 112604 transitions. [2025-03-03 10:36:30,964 INFO L78 Accepts]: Start accepts. Automaton has 106646 states and 112604 transitions. Word has length 510 [2025-03-03 10:36:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:30,964 INFO L471 AbstractCegarLoop]: Abstraction has 106646 states and 112604 transitions. [2025-03-03 10:36:30,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 106646 states and 112604 transitions. [2025-03-03 10:36:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-03 10:36:30,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:30,979 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:36:30,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:30,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -606809038, now seen corresponding path program 1 times [2025-03-03 10:36:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917879257] [2025-03-03 10:36:30,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:31,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-03 10:36:31,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-03 10:36:31,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:31,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-03-03 10:36:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917879257] [2025-03-03 10:36:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917879257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436807827] [2025-03-03 10:36:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:31,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:31,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:31,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:31,625 INFO L87 Difference]: Start difference. First operand 106646 states and 112604 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:34,224 INFO L93 Difference]: Finished difference Result 261354 states and 277019 transitions. [2025-03-03 10:36:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 561 [2025-03-03 10:36:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:34,419 INFO L225 Difference]: With dead ends: 261354 [2025-03-03 10:36:34,419 INFO L226 Difference]: Without dead ends: 155461 [2025-03-03 10:36:34,475 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-03 10:36:34,475 INFO L435 NwaCegarLoop]: 1206 mSDtfsCounter, 681 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:34,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1214 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:36:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155461 states. [2025-03-03 10:36:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155461 to 152457. [2025-03-03 10:36:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152457 states, 152456 states have (on average 1.0549404418323975) internal successors, (160832), 152456 states have internal predecessors, (160832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152457 states to 152457 states and 160832 transitions. [2025-03-03 10:36:35,992 INFO L78 Accepts]: Start accepts. Automaton has 152457 states and 160832 transitions. Word has length 561 [2025-03-03 10:36:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:35,993 INFO L471 AbstractCegarLoop]: Abstraction has 152457 states and 160832 transitions. [2025-03-03 10:36:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 152457 states and 160832 transitions. [2025-03-03 10:36:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-03-03 10:36:36,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:36,007 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:36:36,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:36:36,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:36,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 186274389, now seen corresponding path program 1 times [2025-03-03 10:36:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:36,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470792814] [2025-03-03 10:36:36,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:36,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:36,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-03 10:36:36,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-03 10:36:36,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:36,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 408 proven. 54 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 10:36:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470792814] [2025-03-03 10:36:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470792814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:36:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053939263] [2025-03-03 10:36:37,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:37,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:37,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:36:37,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:36:37,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:36:37,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-03 10:36:37,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-03 10:36:37,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:37,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:37,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:36:37,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:36:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2025-03-03 10:36:37,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:36:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053939263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:37,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:36:37,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:36:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858734239] [2025-03-03 10:36:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:37,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:36:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:37,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:36:37,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:36:37,795 INFO L87 Difference]: Start difference. First operand 152457 states and 160832 transitions. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:42,691 INFO L93 Difference]: Finished difference Result 452861 states and 478676 transitions. [2025-03-03 10:36:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:42,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 615 [2025-03-03 10:36:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:43,029 INFO L225 Difference]: With dead ends: 452861 [2025-03-03 10:36:43,029 INFO L226 Difference]: Without dead ends: 301157 [2025-03-03 10:36:43,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:36:43,059 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1625 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4899 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 5400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 4899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:43,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 63 Invalid, 5400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 4899 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:36:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301157 states. [2025-03-03 10:36:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301157 to 299653. [2025-03-03 10:36:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299653 states, 299652 states have (on average 1.055304152817268) internal successors, (316224), 299652 states have internal predecessors, (316224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299653 states to 299653 states and 316224 transitions. [2025-03-03 10:36:46,469 INFO L78 Accepts]: Start accepts. Automaton has 299653 states and 316224 transitions. Word has length 615 [2025-03-03 10:36:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:46,470 INFO L471 AbstractCegarLoop]: Abstraction has 299653 states and 316224 transitions. [2025-03-03 10:36:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 299653 states and 316224 transitions. [2025-03-03 10:36:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-03 10:36:46,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:46,489 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:46,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:36:46,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:36:46,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1140069965, now seen corresponding path program 1 times [2025-03-03 10:36:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106768781] [2025-03-03 10:36:46,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:46,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-03 10:36:46,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-03 10:36:46,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:46,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 1041 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-03-03 10:36:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106768781] [2025-03-03 10:36:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106768781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:47,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:36:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884273590] [2025-03-03 10:36:47,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:47,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:36:47,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:47,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:36:47,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:36:47,408 INFO L87 Difference]: Start difference. First operand 299653 states and 316224 transitions. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:51,235 INFO L93 Difference]: Finished difference Result 604538 states and 637752 transitions. [2025-03-03 10:36:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:36:51,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 643 [2025-03-03 10:36:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:51,598 INFO L225 Difference]: With dead ends: 604538 [2025-03-03 10:36:51,598 INFO L226 Difference]: Without dead ends: 298879 [2025-03-03 10:36:51,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 10:36:51,639 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 1519 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:51,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1323 Invalid, 3884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:36:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298879 states. [2025-03-03 10:36:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298879 to 283131. [2025-03-03 10:36:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283131 states, 283130 states have (on average 1.0489139264648748) internal successors, (296979), 283130 states have internal predecessors, (296979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283131 states to 283131 states and 296979 transitions. [2025-03-03 10:36:54,647 INFO L78 Accepts]: Start accepts. Automaton has 283131 states and 296979 transitions. Word has length 643 [2025-03-03 10:36:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:36:54,647 INFO L471 AbstractCegarLoop]: Abstraction has 283131 states and 296979 transitions. [2025-03-03 10:36:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 283131 states and 296979 transitions. [2025-03-03 10:36:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-03 10:36:54,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:36:54,667 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:36:54,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:36:54,667 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:36:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:36:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 552717351, now seen corresponding path program 1 times [2025-03-03 10:36:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:36:54,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788277302] [2025-03-03 10:36:54,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:36:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:36:55,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-03 10:36:55,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-03 10:36:55,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:36:55,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:36:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 1130 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-03 10:36:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:36:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788277302] [2025-03-03 10:36:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788277302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:36:55,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:36:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:36:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423366389] [2025-03-03 10:36:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:36:55,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:36:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:36:55,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:36:55,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:36:55,282 INFO L87 Difference]: Start difference. First operand 283131 states and 296979 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:36:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:36:58,519 INFO L93 Difference]: Finished difference Result 564758 states and 592439 transitions. [2025-03-03 10:36:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:36:58,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 644 [2025-03-03 10:36:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:36:58,844 INFO L225 Difference]: With dead ends: 564758 [2025-03-03 10:36:58,845 INFO L226 Difference]: Without dead ends: 282380 [2025-03-03 10:36:58,882 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-03 10:36:58,883 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 698 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:36:58,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1179 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:36:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282380 states.