./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem16_label41.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 50ebe5851919469bd2115fd9df4bc67f7eb85dba2d380b6a5ab23ed124700184 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:14:38,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:14:38,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:14:38,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:14:38,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:14:38,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:14:38,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:14:38,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:14:38,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:14:38,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:14:38,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:14:38,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:14:38,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:14:38,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:14:38,573 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:14:38,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:14:38,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:14:38,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:14:38,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:14:38,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:14:38,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:14:38,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:14:38,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:14:38,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:14:38,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:14:38,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:14:38,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:14:38,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:14:38,576 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 -> 50ebe5851919469bd2115fd9df4bc67f7eb85dba2d380b6a5ab23ed124700184 [2025-03-16 15:14:38,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:14:38,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:14:38,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:14:38,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:14:38,791 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:14:38,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label41.c [2025-03-16 15:14:39,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92da90bea/fa921b94c1ea475fb90b010b9ab6cebe/FLAG5d9889ad1 [2025-03-16 15:14:40,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:14:40,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label41.c [2025-03-16 15:14:40,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92da90bea/fa921b94c1ea475fb90b010b9ab6cebe/FLAG5d9889ad1 [2025-03-16 15:14:40,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92da90bea/fa921b94c1ea475fb90b010b9ab6cebe [2025-03-16 15:14:40,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:14:40,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:14:40,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:14:40,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:14:40,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:14:40,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:40,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357e2eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40, skipping insertion in model container [2025-03-16 15:14:40,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:40,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:14:40,490 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/Problem16_label41.c[2609,2622] [2025-03-16 15:14:40,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:14:40,807 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:14:40,819 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/Problem16_label41.c[2609,2622] [2025-03-16 15:14:40,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:14:40,946 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:14:40,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40 WrapperNode [2025-03-16 15:14:40,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:14:40,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:14:40,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:14:40,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:14:40,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:40,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,072 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:14:41,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:14:41,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:14:41,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:14:41,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:14:41,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,169 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-16 15:14:41,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:14:41,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:14:41,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:14:41,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:14:41,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (1/1) ... [2025-03-16 15:14:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:14:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:41,277 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-16 15:14:41,282 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-16 15:14:41,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:14:41,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:14:41,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:14:41,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:14:41,339 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:14:41,340 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:14:42,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:14:42,761 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:14:42,762 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:14:42,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:14:42,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:14:42,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:14:42 BoogieIcfgContainer [2025-03-16 15:14:42,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:14:42,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:14:42,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:14:42,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:14:42,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:14:40" (1/3) ... [2025-03-16 15:14:42,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b17886b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:14:42, skipping insertion in model container [2025-03-16 15:14:42,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:14:40" (2/3) ... [2025-03-16 15:14:42,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b17886b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:14:42, skipping insertion in model container [2025-03-16 15:14:42,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:14:42" (3/3) ... [2025-03-16 15:14:42,802 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label41.c [2025-03-16 15:14:42,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:14:42,812 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label41.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:14:42,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:14:42,874 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;@76c32df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:14:42,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:14:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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-16 15:14:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 15:14:42,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:42,884 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] [2025-03-16 15:14:42,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:42,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1170135496, now seen corresponding path program 1 times [2025-03-16 15:14:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295937270] [2025-03-16 15:14:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:42,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:42,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 15:14:42,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 15:14:42,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:42,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:43,010 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-16 15:14:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295937270] [2025-03-16 15:14:43,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295937270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186787294] [2025-03-16 15:14:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:43,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:14:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:43,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:14:43,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:14:43,039 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 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 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 15:14:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:43,084 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:14:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:14:43,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2025-03-16 15:14:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:43,097 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:14:43,097 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:14:43,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:14:43,102 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:43,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:14:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:14:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:14:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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-16 15:14:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:14:43,147 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 22 [2025-03-16 15:14:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:43,147 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:14:43,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 15:14:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:14:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 15:14:43,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:43,148 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] [2025-03-16 15:14:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:14:43,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:43,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:43,149 INFO L85 PathProgramCache]: Analyzing trace with hash -131982199, now seen corresponding path program 1 times [2025-03-16 15:14:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269891976] [2025-03-16 15:14:43,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:43,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 15:14:43,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 15:14:43,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:43,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:43,272 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-16 15:14:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269891976] [2025-03-16 15:14:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269891976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:43,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319354341] [2025-03-16 15:14:43,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:43,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:43,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:43,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:43,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:43,279 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-16 15:14:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:44,462 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:14:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:44,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2025-03-16 15:14:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:44,466 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:14:44,468 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:14:44,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:44,471 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 333 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:44,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 157 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:14:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:14:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:14:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5833333333333333) internal successors, (1045), 660 states have internal predecessors, (1045), 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-16 15:14:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1045 transitions. [2025-03-16 15:14:44,505 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1045 transitions. Word has length 22 [2025-03-16 15:14:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:44,505 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1045 transitions. [2025-03-16 15:14:44,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-16 15:14:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1045 transitions. [2025-03-16 15:14:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 15:14:44,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:44,507 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:14:44,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:14:44,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:44,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1541561779, now seen corresponding path program 1 times [2025-03-16 15:14:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893759007] [2025-03-16 15:14:44,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:44,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 15:14:44,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 15:14:44,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:14:44,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893759007] [2025-03-16 15:14:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893759007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:44,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413758914] [2025-03-16 15:14:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:44,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:44,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:44,688 INFO L87 Difference]: Start difference. First operand 661 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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-16 15:14:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:45,822 INFO L93 Difference]: Finished difference Result 1979 states and 3132 transitions. [2025-03-16 15:14:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:45,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 93 [2025-03-16 15:14:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:45,829 INFO L225 Difference]: With dead ends: 1979 [2025-03-16 15:14:45,830 INFO L226 Difference]: Without dead ends: 1319 [2025-03-16 15:14:45,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:45,831 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 277 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:45,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 78 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:14:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-03-16 15:14:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2025-03-16 15:14:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.5060698027314112) internal successors, (1985), 1318 states have internal predecessors, (1985), 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-16 15:14:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1985 transitions. [2025-03-16 15:14:45,858 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1985 transitions. Word has length 93 [2025-03-16 15:14:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:45,858 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1985 transitions. [2025-03-16 15:14:45,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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-16 15:14:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1985 transitions. [2025-03-16 15:14:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-16 15:14:45,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:45,866 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:45,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:14:45,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:45,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 205004085, now seen corresponding path program 1 times [2025-03-16 15:14:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570746339] [2025-03-16 15:14:45,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:45,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-16 15:14:45,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-16 15:14:45,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:45,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:14:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570746339] [2025-03-16 15:14:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570746339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:46,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069700785] [2025-03-16 15:14:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:46,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:46,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:46,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:46,031 INFO L87 Difference]: Start difference. First operand 1319 states and 1985 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-16 15:14:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:47,073 INFO L93 Difference]: Finished difference Result 3953 states and 5952 transitions. [2025-03-16 15:14:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 164 [2025-03-16 15:14:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:47,082 INFO L225 Difference]: With dead ends: 3953 [2025-03-16 15:14:47,082 INFO L226 Difference]: Without dead ends: 2635 [2025-03-16 15:14:47,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:47,085 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 294 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:47,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 203 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:14:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-03-16 15:14:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2025-03-16 15:14:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.3242217160212604) internal successors, (3488), 2634 states have internal predecessors, (3488), 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-16 15:14:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3488 transitions. [2025-03-16 15:14:47,134 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3488 transitions. Word has length 164 [2025-03-16 15:14:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:47,134 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3488 transitions. [2025-03-16 15:14:47,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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-16 15:14:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3488 transitions. [2025-03-16 15:14:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 15:14:47,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:47,153 INFO L218 NwaCegarLoop]: trace histogram [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, 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-16 15:14:47,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:14:47,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:47,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -629106059, now seen corresponding path program 1 times [2025-03-16 15:14:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856804519] [2025-03-16 15:14:47,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:47,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 15:14:47,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 15:14:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:14:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:47,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856804519] [2025-03-16 15:14:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856804519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:47,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:14:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654815603] [2025-03-16 15:14:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:47,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:47,369 INFO L87 Difference]: Start difference. First operand 2635 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-16 15:14:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:48,231 INFO L93 Difference]: Finished difference Result 6585 states and 8893 transitions. [2025-03-16 15:14:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:48,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 188 [2025-03-16 15:14:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:48,242 INFO L225 Difference]: With dead ends: 6585 [2025-03-16 15:14:48,242 INFO L226 Difference]: Without dead ends: 3951 [2025-03-16 15:14:48,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:48,245 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:48,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 154 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:14:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-16 15:14:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3293. [2025-03-16 15:14:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 3292 states have (on average 1.3055893074119076) internal successors, (4298), 3292 states have internal predecessors, (4298), 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-16 15:14:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4298 transitions. [2025-03-16 15:14:48,292 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4298 transitions. Word has length 188 [2025-03-16 15:14:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:48,293 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 4298 transitions. [2025-03-16 15:14:48,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-16 15:14:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4298 transitions. [2025-03-16 15:14:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-16 15:14:48,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:48,295 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:48,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:14:48,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:48,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash 704159707, now seen corresponding path program 1 times [2025-03-16 15:14:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:48,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370415656] [2025-03-16 15:14:48,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:48,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-16 15:14:48,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-16 15:14:48,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:14:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370415656] [2025-03-16 15:14:48,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370415656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:48,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:48,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630727734] [2025-03-16 15:14:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:48,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:14:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:48,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:14:48,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:14:48,736 INFO L87 Difference]: Start difference. First operand 3293 states and 4298 transitions. Second operand has 4 states, 4 states have (on average 65.0) 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-16 15:14:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:49,708 INFO L93 Difference]: Finished difference Result 6914 states and 8942 transitions. [2025-03-16 15:14:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:14:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) 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 280 [2025-03-16 15:14:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:49,718 INFO L225 Difference]: With dead ends: 6914 [2025-03-16 15:14:49,718 INFO L226 Difference]: Without dead ends: 3622 [2025-03-16 15:14:49,720 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-16 15:14:49,721 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 377 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:49,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 320 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:14:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-03-16 15:14:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2025-03-16 15:14:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3621 states have (on average 1.27948080640707) internal successors, (4633), 3621 states have internal predecessors, (4633), 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-16 15:14:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4633 transitions. [2025-03-16 15:14:49,765 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4633 transitions. Word has length 280 [2025-03-16 15:14:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:49,765 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 4633 transitions. [2025-03-16 15:14:49,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) 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-16 15:14:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4633 transitions. [2025-03-16 15:14:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-16 15:14:49,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:49,772 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 15:14:49,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:14:49,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1419922489, now seen corresponding path program 1 times [2025-03-16 15:14:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:49,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261574039] [2025-03-16 15:14:49,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:49,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-16 15:14:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-16 15:14:49,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:49,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 15:14:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261574039] [2025-03-16 15:14:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261574039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202476817] [2025-03-16 15:14:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:49,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:49,978 INFO L87 Difference]: Start difference. First operand 3622 states and 4633 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-16 15:14:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:50,927 INFO L93 Difference]: Finished difference Result 9546 states and 12418 transitions. [2025-03-16 15:14:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:50,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 367 [2025-03-16 15:14:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:50,937 INFO L225 Difference]: With dead ends: 9546 [2025-03-16 15:14:50,937 INFO L226 Difference]: Without dead ends: 4938 [2025-03-16 15:14:50,941 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-16 15:14:50,942 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 231 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:50,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 538 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:14:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2025-03-16 15:14:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4938. [2025-03-16 15:14:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.0814259671865505) internal successors, (5339), 4937 states have internal predecessors, (5339), 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-16 15:14:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 5339 transitions. [2025-03-16 15:14:51,015 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 5339 transitions. Word has length 367 [2025-03-16 15:14:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:51,015 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 5339 transitions. [2025-03-16 15:14:51,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-16 15:14:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 5339 transitions. [2025-03-16 15:14:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-16 15:14:51,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:51,025 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:14:51,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:14:51,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1999024554, now seen corresponding path program 1 times [2025-03-16 15:14:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791928554] [2025-03-16 15:14:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-16 15:14:51,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-16 15:14:51,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:51,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 418 proven. 101 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-16 15:14:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791928554] [2025-03-16 15:14:51,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791928554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410471319] [2025-03-16 15:14:51,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:51,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:51,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:14:51,778 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-16 15:14:51,780 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-16 15:14:51,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-16 15:14:51,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-16 15:14:51,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:51,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:51,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:14:51,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:14:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-16 15:14:52,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:14:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410471319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:14:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-16 15:14:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185180022] [2025-03-16 15:14:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:14:52,301 INFO L87 Difference]: Start difference. First operand 4938 states and 5339 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 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-16 15:14:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:52,897 INFO L93 Difference]: Finished difference Result 10533 states and 11402 transitions. [2025-03-16 15:14:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 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 553 [2025-03-16 15:14:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:52,908 INFO L225 Difference]: With dead ends: 10533 [2025-03-16 15:14:52,909 INFO L226 Difference]: Without dead ends: 5925 [2025-03-16 15:14:52,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:14:52,912 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:52,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 30 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2025-03-16 15:14:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5925. [2025-03-16 15:14:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 5924 states have (on average 1.061444969615125) internal successors, (6288), 5924 states have internal predecessors, (6288), 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-16 15:14:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6288 transitions. [2025-03-16 15:14:52,968 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6288 transitions. Word has length 553 [2025-03-16 15:14:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:52,968 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 6288 transitions. [2025-03-16 15:14:52,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 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-16 15:14:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6288 transitions. [2025-03-16 15:14:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-03-16 15:14:52,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:52,978 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 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] [2025-03-16 15:14:52,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:14:53,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:14:53,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:53,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1737561895, now seen corresponding path program 1 times [2025-03-16 15:14:53,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:53,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839393617] [2025-03-16 15:14:53,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:53,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:53,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-03-16 15:14:53,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-03-16 15:14:53,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:53,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-16 15:14:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839393617] [2025-03-16 15:14:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839393617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317447652] [2025-03-16 15:14:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:53,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:14:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:54,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:14:54,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:14:54,001 INFO L87 Difference]: Start difference. First operand 5925 states and 6288 transitions. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 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-16 15:14:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:54,778 INFO L93 Difference]: Finished difference Result 11849 states and 12584 transitions. [2025-03-16 15:14:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:54,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 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 678 [2025-03-16 15:14:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:54,792 INFO L225 Difference]: With dead ends: 11849 [2025-03-16 15:14:54,792 INFO L226 Difference]: Without dead ends: 6254 [2025-03-16 15:14:54,797 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-16 15:14:54,797 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 205 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:54,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 109 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:14:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2025-03-16 15:14:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6254. [2025-03-16 15:14:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.0588517511594435) internal successors, (6621), 6253 states have internal predecessors, (6621), 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-16 15:14:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6621 transitions. [2025-03-16 15:14:54,858 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6621 transitions. Word has length 678 [2025-03-16 15:14:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:54,858 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6621 transitions. [2025-03-16 15:14:54,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 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-16 15:14:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6621 transitions. [2025-03-16 15:14:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2025-03-16 15:14:54,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:54,866 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-16 15:14:54,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:14:54,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1014446453, now seen corresponding path program 1 times [2025-03-16 15:14:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948565038] [2025-03-16 15:14:54,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:54,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 782 statements into 1 equivalence classes. [2025-03-16 15:14:54,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 782 of 782 statements. [2025-03-16 15:14:54,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:54,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 1142 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-16 15:14:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948565038] [2025-03-16 15:14:55,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948565038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:55,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:55,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:55,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031666819] [2025-03-16 15:14:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:55,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:55,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:55,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:55,354 INFO L87 Difference]: Start difference. First operand 6254 states and 6621 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-16 15:14:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:56,012 INFO L93 Difference]: Finished difference Result 14810 states and 15806 transitions. [2025-03-16 15:14:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:56,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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 782 [2025-03-16 15:14:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:56,026 INFO L225 Difference]: With dead ends: 14810 [2025-03-16 15:14:56,026 INFO L226 Difference]: Without dead ends: 9215 [2025-03-16 15:14:56,030 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-16 15:14:56,030 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:56,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 35 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9215 states. [2025-03-16 15:14:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9215 to 9215. [2025-03-16 15:14:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.0621879748209246) internal successors, (9787), 9214 states have internal predecessors, (9787), 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-16 15:14:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 9787 transitions. [2025-03-16 15:14:56,093 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 9787 transitions. Word has length 782 [2025-03-16 15:14:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:56,093 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 9787 transitions. [2025-03-16 15:14:56,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-16 15:14:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 9787 transitions. [2025-03-16 15:14:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1023 [2025-03-16 15:14:56,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:56,105 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:14:56,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:14:56,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:56,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1456637992, now seen corresponding path program 1 times [2025-03-16 15:14:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:56,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193109015] [2025-03-16 15:14:56,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:56,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1022 statements into 1 equivalence classes. [2025-03-16 15:14:56,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1022 of 1022 statements. [2025-03-16 15:14:56,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:56,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1777 backedges. 1297 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-16 15:14:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193109015] [2025-03-16 15:14:56,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193109015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:56,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:56,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983991540] [2025-03-16 15:14:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:56,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:56,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:56,609 INFO L87 Difference]: Start difference. First operand 9215 states and 9787 transitions. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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-16 15:14:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:57,250 INFO L93 Difference]: Finished difference Result 20732 states and 22138 transitions. [2025-03-16 15:14:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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 1022 [2025-03-16 15:14:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:57,267 INFO L225 Difference]: With dead ends: 20732 [2025-03-16 15:14:57,267 INFO L226 Difference]: Without dead ends: 12176 [2025-03-16 15:14:57,274 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-16 15:14:57,276 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:57,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12176 states. [2025-03-16 15:14:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12176 to 11518. [2025-03-16 15:14:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11518 states, 11517 states have (on average 1.0537466354085265) internal successors, (12136), 11517 states have internal predecessors, (12136), 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-16 15:14:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 12136 transitions. [2025-03-16 15:14:57,412 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 12136 transitions. Word has length 1022 [2025-03-16 15:14:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:57,412 INFO L471 AbstractCegarLoop]: Abstraction has 11518 states and 12136 transitions. [2025-03-16 15:14:57,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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-16 15:14:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 12136 transitions. [2025-03-16 15:14:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2025-03-16 15:14:57,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:57,425 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:14:57,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:14:57,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:57,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 24760740, now seen corresponding path program 1 times [2025-03-16 15:14:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:57,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996045050] [2025-03-16 15:14:57,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:57,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1023 statements into 1 equivalence classes. [2025-03-16 15:14:57,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1023 of 1023 statements. [2025-03-16 15:14:57,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:57,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 1345 trivial. 0 not checked. [2025-03-16 15:14:57,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:57,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996045050] [2025-03-16 15:14:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996045050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:57,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599446510] [2025-03-16 15:14:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:57,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:57,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:57,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:57,843 INFO L87 Difference]: Start difference. First operand 11518 states and 12136 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-16 15:14:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:58,445 INFO L93 Difference]: Finished difference Result 25009 states and 26422 transitions. [2025-03-16 15:14:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:58,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 1023 [2025-03-16 15:14:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:58,463 INFO L225 Difference]: With dead ends: 25009 [2025-03-16 15:14:58,463 INFO L226 Difference]: Without dead ends: 12505 [2025-03-16 15:14:58,473 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-16 15:14:58,473 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 273 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:58,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 410 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:14:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2025-03-16 15:14:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 10860. [2025-03-16 15:14:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.0438346072382356) internal successors, (11335), 10859 states have internal predecessors, (11335), 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-16 15:14:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11335 transitions. [2025-03-16 15:14:58,608 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11335 transitions. Word has length 1023 [2025-03-16 15:14:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:58,609 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11335 transitions. [2025-03-16 15:14:58,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-16 15:14:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11335 transitions. [2025-03-16 15:14:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2025-03-16 15:14:58,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:58,632 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:58,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:14:58,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:58,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1420396641, now seen corresponding path program 1 times [2025-03-16 15:14:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953909780] [2025-03-16 15:14:58,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:58,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1142 statements into 1 equivalence classes. [2025-03-16 15:14:58,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1142 of 1142 statements. [2025-03-16 15:14:58,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:58,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:14:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2589 backedges. 1781 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-16 15:14:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:14:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953909780] [2025-03-16 15:14:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953909780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:14:59,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:14:59,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:14:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350277142] [2025-03-16 15:14:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:59,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:59,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:59,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:14:59,200 INFO L87 Difference]: Start difference. First operand 10860 states and 11335 transitions. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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-16 15:14:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:14:59,738 INFO L93 Difference]: Finished difference Result 22706 states and 23727 transitions. [2025-03-16 15:14:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:14:59,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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 1142 [2025-03-16 15:14:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:14:59,750 INFO L225 Difference]: With dead ends: 22706 [2025-03-16 15:14:59,750 INFO L226 Difference]: Without dead ends: 12505 [2025-03-16 15:14:59,758 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-16 15:14:59,759 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:14:59,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 414 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:14:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2025-03-16 15:14:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12505. [2025-03-16 15:14:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0391074856046065) internal successors, (12993), 12504 states have internal predecessors, (12993), 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-16 15:14:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 12993 transitions. [2025-03-16 15:14:59,852 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 12993 transitions. Word has length 1142 [2025-03-16 15:14:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:14:59,853 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 12993 transitions. [2025-03-16 15:14:59,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 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-16 15:14:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 12993 transitions. [2025-03-16 15:14:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2025-03-16 15:14:59,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:14:59,867 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:14:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:14:59,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:14:59,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:14:59,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1116692473, now seen corresponding path program 1 times [2025-03-16 15:14:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:14:59,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124341481] [2025-03-16 15:14:59,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:14:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:14:59,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1171 statements into 1 equivalence classes. [2025-03-16 15:14:59,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1171 of 1171 statements. [2025-03-16 15:14:59,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:14:59,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2703 backedges. 1917 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-16 15:15:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124341481] [2025-03-16 15:15:00,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124341481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:00,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:00,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193833281] [2025-03-16 15:15:00,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:00,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:00,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:00,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:00,308 INFO L87 Difference]: Start difference. First operand 12505 states and 12993 transitions. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-16 15:15:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:00,870 INFO L93 Difference]: Finished difference Result 24351 states and 25321 transitions. [2025-03-16 15:15:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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 1171 [2025-03-16 15:15:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:00,881 INFO L225 Difference]: With dead ends: 24351 [2025-03-16 15:15:00,881 INFO L226 Difference]: Without dead ends: 12505 [2025-03-16 15:15:00,889 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-16 15:15:00,890 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:00,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 418 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2025-03-16 15:15:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12176. [2025-03-16 15:15:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12175 states have (on average 1.031375770020534) internal successors, (12557), 12175 states have internal predecessors, (12557), 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-16 15:15:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 12557 transitions. [2025-03-16 15:15:00,980 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 12557 transitions. Word has length 1171 [2025-03-16 15:15:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:00,980 INFO L471 AbstractCegarLoop]: Abstraction has 12176 states and 12557 transitions. [2025-03-16 15:15:00,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-16 15:15:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 12557 transitions. [2025-03-16 15:15:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2025-03-16 15:15:01,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:01,018 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:15:01,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:15:01,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:01,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash -88767005, now seen corresponding path program 1 times [2025-03-16 15:15:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226171348] [2025-03-16 15:15:01,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:01,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1181 statements into 1 equivalence classes. [2025-03-16 15:15:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1181 of 1181 statements. [2025-03-16 15:15:01,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:01,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2228 backedges. 1584 proven. 0 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2025-03-16 15:15:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226171348] [2025-03-16 15:15:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226171348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:02,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:15:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075883601] [2025-03-16 15:15:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:15:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:02,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:15:02,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:15:02,093 INFO L87 Difference]: Start difference. First operand 12176 states and 12557 transitions. Second operand has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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-16 15:15:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:02,787 INFO L93 Difference]: Finished difference Result 23703 states and 24459 transitions. [2025-03-16 15:15:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:15:02,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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 1181 [2025-03-16 15:15:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:02,798 INFO L225 Difference]: With dead ends: 23703 [2025-03-16 15:15:02,798 INFO L226 Difference]: Without dead ends: 12186 [2025-03-16 15:15:02,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 15:15:02,805 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:02,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 433 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:15:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12186 states. [2025-03-16 15:15:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12186 to 12176. [2025-03-16 15:15:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12175 states have (on average 1.0312114989733059) internal successors, (12555), 12175 states have internal predecessors, (12555), 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-16 15:15:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 12555 transitions. [2025-03-16 15:15:02,889 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 12555 transitions. Word has length 1181 [2025-03-16 15:15:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:02,890 INFO L471 AbstractCegarLoop]: Abstraction has 12176 states and 12555 transitions. [2025-03-16 15:15:02,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 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-16 15:15:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 12555 transitions. [2025-03-16 15:15:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2025-03-16 15:15:02,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:02,902 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:02,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:15:02,902 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:02,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1095038020, now seen corresponding path program 1 times [2025-03-16 15:15:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330012689] [2025-03-16 15:15:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:02,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-03-16 15:15:02,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-03-16 15:15:02,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:02,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2853 backedges. 1535 proven. 0 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2025-03-16 15:15:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:03,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330012689] [2025-03-16 15:15:03,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330012689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:03,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:03,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:03,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334805478] [2025-03-16 15:15:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:03,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:03,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:03,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:03,656 INFO L87 Difference]: Start difference. First operand 12176 states and 12555 transitions. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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-16 15:15:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:04,163 INFO L93 Difference]: Finished difference Result 24351 states and 25114 transitions. [2025-03-16 15:15:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:04,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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 1196 [2025-03-16 15:15:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:04,173 INFO L225 Difference]: With dead ends: 24351 [2025-03-16 15:15:04,173 INFO L226 Difference]: Without dead ends: 12834 [2025-03-16 15:15:04,179 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-16 15:15:04,179 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:04,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 428 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2025-03-16 15:15:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12834. [2025-03-16 15:15:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0300007792410193) internal successors, (13218), 12833 states have internal predecessors, (13218), 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-16 15:15:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13218 transitions. [2025-03-16 15:15:04,258 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13218 transitions. Word has length 1196 [2025-03-16 15:15:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:04,258 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13218 transitions. [2025-03-16 15:15:04,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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-16 15:15:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13218 transitions. [2025-03-16 15:15:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1222 [2025-03-16 15:15:04,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:04,271 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:15:04,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:15:04,271 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:04,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1347720431, now seen corresponding path program 1 times [2025-03-16 15:15:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937177555] [2025-03-16 15:15:04,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:04,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:04,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-16 15:15:04,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-16 15:15:04,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:04,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2499 backedges. 1685 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2025-03-16 15:15:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937177555] [2025-03-16 15:15:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937177555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:15:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369661024] [2025-03-16 15:15:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:05,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:15:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:05,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:15:05,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:15:05,146 INFO L87 Difference]: Start difference. First operand 12834 states and 13218 transitions. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 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-16 15:15:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:05,857 INFO L93 Difference]: Finished difference Result 25009 states and 25771 transitions. [2025-03-16 15:15:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:15:05,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 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 1221 [2025-03-16 15:15:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:05,867 INFO L225 Difference]: With dead ends: 25009 [2025-03-16 15:15:05,867 INFO L226 Difference]: Without dead ends: 12834 [2025-03-16 15:15:05,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 15:15:05,874 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 120 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:05,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 550 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:15:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2025-03-16 15:15:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12834. [2025-03-16 15:15:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0290656900179225) internal successors, (13206), 12833 states have internal predecessors, (13206), 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-16 15:15:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13206 transitions. [2025-03-16 15:15:05,951 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13206 transitions. Word has length 1221 [2025-03-16 15:15:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:05,952 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13206 transitions. [2025-03-16 15:15:05,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 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-16 15:15:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13206 transitions. [2025-03-16 15:15:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2025-03-16 15:15:05,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:05,964 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:05,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:15:05,964 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:05,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2037672813, now seen corresponding path program 1 times [2025-03-16 15:15:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655629440] [2025-03-16 15:15:05,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:06,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1250 statements into 1 equivalence classes. [2025-03-16 15:15:06,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1250 of 1250 statements. [2025-03-16 15:15:06,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:06,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2874 backedges. 1151 proven. 994 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-03-16 15:15:06,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:06,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655629440] [2025-03-16 15:15:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655629440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:06,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825880058] [2025-03-16 15:15:06,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:06,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:06,987 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-16 15:15:06,988 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-16 15:15:07,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1250 statements into 1 equivalence classes. [2025-03-16 15:15:07,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1250 of 1250 statements. [2025-03-16 15:15:07,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:07,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:07,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:15:07,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2874 backedges. 1728 proven. 0 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2025-03-16 15:15:07,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:15:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825880058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:15:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:15:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843075882] [2025-03-16 15:15:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:07,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:07,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:07,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:07,698 INFO L87 Difference]: Start difference. First operand 12834 states and 13206 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-16 15:15:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:08,195 INFO L93 Difference]: Finished difference Result 25009 states and 25747 transitions. [2025-03-16 15:15:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:08,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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 1250 [2025-03-16 15:15:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:08,204 INFO L225 Difference]: With dead ends: 25009 [2025-03-16 15:15:08,204 INFO L226 Difference]: Without dead ends: 12834 [2025-03-16 15:15:08,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1254 GetRequests, 1250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:08,210 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:08,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 375 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:15:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2025-03-16 15:15:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12834. [2025-03-16 15:15:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0268058910621054) internal successors, (13177), 12833 states have internal predecessors, (13177), 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-16 15:15:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13177 transitions. [2025-03-16 15:15:08,287 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13177 transitions. Word has length 1250 [2025-03-16 15:15:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:08,287 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13177 transitions. [2025-03-16 15:15:08,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-16 15:15:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13177 transitions. [2025-03-16 15:15:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2025-03-16 15:15:08,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:08,299 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:08,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:15:08,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 15:15:08,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash -402084793, now seen corresponding path program 1 times [2025-03-16 15:15:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103409685] [2025-03-16 15:15:08,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:08,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1318 statements into 1 equivalence classes. [2025-03-16 15:15:08,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1318 of 1318 statements. [2025-03-16 15:15:08,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:08,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3368 backedges. 640 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-16 15:15:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103409685] [2025-03-16 15:15:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103409685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:09,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:09,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:09,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725507807] [2025-03-16 15:15:09,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:09,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:09,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:09,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:09,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:09,004 INFO L87 Difference]: Start difference. First operand 12834 states and 13177 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-16 15:15:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:09,522 INFO L93 Difference]: Finished difference Result 25338 states and 26022 transitions. [2025-03-16 15:15:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 1318 [2025-03-16 15:15:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:09,533 INFO L225 Difference]: With dead ends: 25338 [2025-03-16 15:15:09,533 INFO L226 Difference]: Without dead ends: 12834 [2025-03-16 15:15:09,541 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-16 15:15:09,541 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 266 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:09,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 408 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12834 states. [2025-03-16 15:15:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12834 to 12505. [2025-03-16 15:15:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0194337811900192) internal successors, (12747), 12504 states have internal predecessors, (12747), 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-16 15:15:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 12747 transitions. [2025-03-16 15:15:09,618 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 12747 transitions. Word has length 1318 [2025-03-16 15:15:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:09,618 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 12747 transitions. [2025-03-16 15:15:09,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-16 15:15:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 12747 transitions. [2025-03-16 15:15:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1748 [2025-03-16 15:15:09,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:09,635 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:09,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:15:09,636 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:09,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1028283596, now seen corresponding path program 1 times [2025-03-16 15:15:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222948198] [2025-03-16 15:15:09,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:09,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-16 15:15:09,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-16 15:15:09,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:09,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 3154 proven. 66 refuted. 0 times theorem prover too weak. 2800 trivial. 0 not checked. [2025-03-16 15:15:11,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:11,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222948198] [2025-03-16 15:15:11,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222948198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:11,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039086151] [2025-03-16 15:15:11,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:11,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:11,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:11,060 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-16 15:15:11,061 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-16 15:15:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1747 statements into 1 equivalence classes. [2025-03-16 15:15:11,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1747 of 1747 statements. [2025-03-16 15:15:11,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:11,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:11,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 2026 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:15:11,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 2495 proven. 201 refuted. 0 times theorem prover too weak. 3324 trivial. 0 not checked. [2025-03-16 15:15:13,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:15:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 2495 proven. 201 refuted. 0 times theorem prover too weak. 3324 trivial. 0 not checked. [2025-03-16 15:15:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039086151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:15:16,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:15:16,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-16 15:15:16,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453370633] [2025-03-16 15:15:16,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:15:16,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:15:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:16,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:15:16,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:15:16,190 INFO L87 Difference]: Start difference. First operand 12505 states and 12747 transitions. Second operand has 9 states, 9 states have (on average 189.66666666666666) internal successors, (1707), 8 states have internal predecessors, (1707), 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-16 15:15:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:19,501 INFO L93 Difference]: Finished difference Result 35537 states and 36231 transitions. [2025-03-16 15:15:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:15:19,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 189.66666666666666) internal successors, (1707), 8 states have internal predecessors, (1707), 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 1747 [2025-03-16 15:15:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:19,523 INFO L225 Difference]: With dead ends: 35537 [2025-03-16 15:15:19,523 INFO L226 Difference]: Without dead ends: 23691 [2025-03-16 15:15:19,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3504 GetRequests, 3489 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-16 15:15:19,531 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1666 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5855 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 5855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:19,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 75 Invalid, 6091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 5855 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 15:15:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23691 states. [2025-03-16 15:15:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23691 to 17769. [2025-03-16 15:15:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.0187415578568213) internal successors, (18101), 17768 states have internal predecessors, (18101), 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-16 15:15:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18101 transitions. [2025-03-16 15:15:19,669 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18101 transitions. Word has length 1747 [2025-03-16 15:15:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:19,669 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18101 transitions. [2025-03-16 15:15:19,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.66666666666666) internal successors, (1707), 8 states have internal predecessors, (1707), 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-16 15:15:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18101 transitions. [2025-03-16 15:15:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1841 [2025-03-16 15:15:19,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:19,726 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:19,734 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-16 15:15:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:19,926 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash -310011349, now seen corresponding path program 1 times [2025-03-16 15:15:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528955618] [2025-03-16 15:15:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:20,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1840 statements into 1 equivalence classes. [2025-03-16 15:15:20,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1840 of 1840 statements. [2025-03-16 15:15:20,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:20,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7075 backedges. 3572 proven. 0 refuted. 0 times theorem prover too weak. 3503 trivial. 0 not checked. [2025-03-16 15:15:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528955618] [2025-03-16 15:15:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528955618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:21,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:15:21,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:15:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177036354] [2025-03-16 15:15:21,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:21,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:21,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:21,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:21,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:15:21,401 INFO L87 Difference]: Start difference. First operand 17769 states and 18101 transitions. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-16 15:15:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:21,988 INFO L93 Difference]: Finished difference Result 37840 states and 38544 transitions. [2025-03-16 15:15:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:21,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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 1840 [2025-03-16 15:15:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:22,008 INFO L225 Difference]: With dead ends: 37840 [2025-03-16 15:15:22,009 INFO L226 Difference]: Without dead ends: 20730 [2025-03-16 15:15:22,020 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-16 15:15:22,021 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 208 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:22,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 43 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20730 states. [2025-03-16 15:15:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20730 to 18756. [2025-03-16 15:15:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18756 states, 18755 states have (on average 1.0181284990669155) internal successors, (19095), 18755 states have internal predecessors, (19095), 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-16 15:15:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18756 states to 18756 states and 19095 transitions. [2025-03-16 15:15:22,222 INFO L78 Accepts]: Start accepts. Automaton has 18756 states and 19095 transitions. Word has length 1840 [2025-03-16 15:15:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:22,222 INFO L471 AbstractCegarLoop]: Abstraction has 18756 states and 19095 transitions. [2025-03-16 15:15:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-16 15:15:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 18756 states and 19095 transitions. [2025-03-16 15:15:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1882 [2025-03-16 15:15:22,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:22,249 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:22,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:15:22,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -834931217, now seen corresponding path program 1 times [2025-03-16 15:15:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793406532] [2025-03-16 15:15:22,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:22,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1881 statements into 1 equivalence classes. [2025-03-16 15:15:22,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1881 of 1881 statements. [2025-03-16 15:15:22,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:22,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 5887 proven. 41 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2025-03-16 15:15:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793406532] [2025-03-16 15:15:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793406532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:24,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144486605] [2025-03-16 15:15:24,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:24,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:15:24,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:15:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1881 statements into 1 equivalence classes. [2025-03-16 15:15:24,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1881 of 1881 statements. [2025-03-16 15:15:24,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:24,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:24,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 2204 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:15:24,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7884 backedges. 4545 proven. 0 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2025-03-16 15:15:25,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:15:25,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144486605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:25,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:15:25,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:15:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966454978] [2025-03-16 15:15:25,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:25,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:25,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:25,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:25,050 INFO L87 Difference]: Start difference. First operand 18756 states and 19095 transitions. Second operand has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 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-16 15:15:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:25,565 INFO L93 Difference]: Finished difference Result 36853 states and 37527 transitions. [2025-03-16 15:15:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:25,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 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 1881 [2025-03-16 15:15:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:25,580 INFO L225 Difference]: With dead ends: 36853 [2025-03-16 15:15:25,580 INFO L226 Difference]: Without dead ends: 18756 [2025-03-16 15:15:25,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1885 GetRequests, 1881 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:15:25,591 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:25,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 422 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:15:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18756 states. [2025-03-16 15:15:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18756 to 18756. [2025-03-16 15:15:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18756 states, 18755 states have (on average 1.0179152226073047) internal successors, (19091), 18755 states have internal predecessors, (19091), 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-16 15:15:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18756 states to 18756 states and 19091 transitions. [2025-03-16 15:15:25,726 INFO L78 Accepts]: Start accepts. Automaton has 18756 states and 19091 transitions. Word has length 1881 [2025-03-16 15:15:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:25,727 INFO L471 AbstractCegarLoop]: Abstraction has 18756 states and 19091 transitions. [2025-03-16 15:15:25,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 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-16 15:15:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18756 states and 19091 transitions. [2025-03-16 15:15:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1903 [2025-03-16 15:15:25,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:25,795 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:15:25,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:15:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:25,996 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:25,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash -996882638, now seen corresponding path program 1 times [2025-03-16 15:15:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709783372] [2025-03-16 15:15:25,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:26,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1902 statements into 1 equivalence classes. [2025-03-16 15:15:26,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1902 of 1902 statements. [2025-03-16 15:15:26,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:26,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7628 backedges. 5403 proven. 153 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2025-03-16 15:15:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709783372] [2025-03-16 15:15:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709783372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240596361] [2025-03-16 15:15:27,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:27,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:27,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:27,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:15:27,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:15:27,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1902 statements into 1 equivalence classes. [2025-03-16 15:15:28,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1902 of 1902 statements. [2025-03-16 15:15:28,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:28,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:28,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:15:28,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7628 backedges. 4634 proven. 0 refuted. 0 times theorem prover too weak. 2994 trivial. 0 not checked. [2025-03-16 15:15:28,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:15:28,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240596361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:28,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:15:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:15:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772788052] [2025-03-16 15:15:28,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:28,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:28,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:28,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:28,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:15:28,324 INFO L87 Difference]: Start difference. First operand 18756 states and 19091 transitions. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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-16 15:15:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:28,961 INFO L93 Difference]: Finished difference Result 38827 states and 39532 transitions. [2025-03-16 15:15:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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 1902 [2025-03-16 15:15:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:28,981 INFO L225 Difference]: With dead ends: 38827 [2025-03-16 15:15:28,981 INFO L226 Difference]: Without dead ends: 20730 [2025-03-16 15:15:28,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1907 GetRequests, 1902 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:15:28,994 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:28,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 423 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20730 states. [2025-03-16 15:15:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20730 to 19743. [2025-03-16 15:15:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19743 states, 19742 states have (on average 1.0175260865160571) internal successors, (20088), 19742 states have internal predecessors, (20088), 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-16 15:15:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19743 states to 19743 states and 20088 transitions. [2025-03-16 15:15:29,174 INFO L78 Accepts]: Start accepts. Automaton has 19743 states and 20088 transitions. Word has length 1902 [2025-03-16 15:15:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:29,175 INFO L471 AbstractCegarLoop]: Abstraction has 19743 states and 20088 transitions. [2025-03-16 15:15:29,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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-16 15:15:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19743 states and 20088 transitions. [2025-03-16 15:15:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1934 [2025-03-16 15:15:29,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:29,196 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:15:29,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:15:29,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 15:15:29,397 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:29,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash -794458390, now seen corresponding path program 1 times [2025-03-16 15:15:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:29,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101370620] [2025-03-16 15:15:29,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:29,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:29,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1933 statements into 1 equivalence classes. [2025-03-16 15:15:29,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1933 of 1933 statements. [2025-03-16 15:15:29,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:29,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 5946 proven. 91 refuted. 0 times theorem prover too weak. 1963 trivial. 0 not checked. [2025-03-16 15:15:31,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101370620] [2025-03-16 15:15:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101370620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721287703] [2025-03-16 15:15:31,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:31,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:31,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:15:31,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:15:31,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1933 statements into 1 equivalence classes. [2025-03-16 15:15:31,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1933 of 1933 statements. [2025-03-16 15:15:31,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:31,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:31,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 2253 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:15:31,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 5052 proven. 67 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2025-03-16 15:15:39,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:15:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 4044 proven. 0 refuted. 0 times theorem prover too weak. 3956 trivial. 0 not checked. [2025-03-16 15:15:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721287703] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:42,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:15:42,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-16 15:15:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675923146] [2025-03-16 15:15:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:42,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:42,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:15:42,617 INFO L87 Difference]: Start difference. First operand 19743 states and 20088 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-16 15:15:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:43,245 INFO L93 Difference]: Finished difference Result 40472 states and 41184 transitions. [2025-03-16 15:15:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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 1933 [2025-03-16 15:15:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:43,265 INFO L225 Difference]: With dead ends: 40472 [2025-03-16 15:15:43,265 INFO L226 Difference]: Without dead ends: 21388 [2025-03-16 15:15:43,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3870 GetRequests, 3863 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:15:43,278 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 268 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:43,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 33 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:15:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21388 states. [2025-03-16 15:15:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21388 to 19743. [2025-03-16 15:15:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19743 states, 19742 states have (on average 1.016816938506737) internal successors, (20074), 19742 states have internal predecessors, (20074), 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-16 15:15:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19743 states to 19743 states and 20074 transitions. [2025-03-16 15:15:43,440 INFO L78 Accepts]: Start accepts. Automaton has 19743 states and 20074 transitions. Word has length 1933 [2025-03-16 15:15:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:43,440 INFO L471 AbstractCegarLoop]: Abstraction has 19743 states and 20074 transitions. [2025-03-16 15:15:43,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-16 15:15:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 19743 states and 20074 transitions. [2025-03-16 15:15:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1984 [2025-03-16 15:15:43,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:43,462 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:15:43,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:15:43,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:43,662 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:43,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash -372167144, now seen corresponding path program 1 times [2025-03-16 15:15:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663115572] [2025-03-16 15:15:43,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:43,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1983 statements into 1 equivalence classes. [2025-03-16 15:15:43,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1983 of 1983 statements. [2025-03-16 15:15:43,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:43,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 5511 proven. 79 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2025-03-16 15:15:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663115572] [2025-03-16 15:15:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663115572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892915234] [2025-03-16 15:15:45,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:45,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:45,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:45,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:15:45,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:15:45,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1983 statements into 1 equivalence classes. [2025-03-16 15:15:46,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1983 of 1983 statements. [2025-03-16 15:15:46,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:46,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:46,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 2305 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:15:46,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 4809 proven. 250 refuted. 0 times theorem prover too weak. 3315 trivial. 0 not checked. [2025-03-16 15:15:46,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:15:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 3878 proven. 0 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2025-03-16 15:15:47,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892915234] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:47,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:15:47,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-16 15:15:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294150455] [2025-03-16 15:15:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:47,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:47,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:47,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:47,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:15:47,877 INFO L87 Difference]: Start difference. First operand 19743 states and 20074 transitions. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-16 15:15:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:48,556 INFO L93 Difference]: Finished difference Result 39485 states and 40147 transitions. [2025-03-16 15:15:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:48,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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 1983 [2025-03-16 15:15:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:48,577 INFO L225 Difference]: With dead ends: 39485 [2025-03-16 15:15:48,578 INFO L226 Difference]: Without dead ends: 20072 [2025-03-16 15:15:48,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3968 GetRequests, 3963 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:15:48,591 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:48,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 15 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:15:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20072 states. [2025-03-16 15:15:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20072 to 19414. [2025-03-16 15:15:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19414 states, 19413 states have (on average 1.0164322876423015) internal successors, (19732), 19413 states have internal predecessors, (19732), 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-16 15:15:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19414 states to 19414 states and 19732 transitions. [2025-03-16 15:15:48,803 INFO L78 Accepts]: Start accepts. Automaton has 19414 states and 19732 transitions. Word has length 1983 [2025-03-16 15:15:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:48,804 INFO L471 AbstractCegarLoop]: Abstraction has 19414 states and 19732 transitions. [2025-03-16 15:15:48,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-16 15:15:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 19414 states and 19732 transitions. [2025-03-16 15:15:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2051 [2025-03-16 15:15:48,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:48,827 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:15:48,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:15:49,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:49,028 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 463012992, now seen corresponding path program 1 times [2025-03-16 15:15:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031332432] [2025-03-16 15:15:49,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:49,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2050 statements into 1 equivalence classes. [2025-03-16 15:15:49,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2050 of 2050 statements. [2025-03-16 15:15:49,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:49,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9198 backedges. 5912 proven. 79 refuted. 0 times theorem prover too weak. 3207 trivial. 0 not checked. [2025-03-16 15:15:51,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031332432] [2025-03-16 15:15:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031332432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976639773] [2025-03-16 15:15:51,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:51,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:51,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:51,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:15:51,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:15:51,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2050 statements into 1 equivalence classes. [2025-03-16 15:15:51,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2050 of 2050 statements. [2025-03-16 15:15:51,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:51,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:51,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 2392 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:15:51,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9198 backedges. 5391 proven. 0 refuted. 0 times theorem prover too weak. 3807 trivial. 0 not checked. [2025-03-16 15:15:52,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:15:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976639773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:15:52,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:15:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:15:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635883037] [2025-03-16 15:15:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:15:52,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:15:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:15:52,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:15:52,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:15:52,214 INFO L87 Difference]: Start difference. First operand 19414 states and 19732 transitions. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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-16 15:15:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:15:52,772 INFO L93 Difference]: Finished difference Result 39814 states and 40487 transitions. [2025-03-16 15:15:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:15:52,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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 2050 [2025-03-16 15:15:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:15:52,789 INFO L225 Difference]: With dead ends: 39814 [2025-03-16 15:15:52,789 INFO L226 Difference]: Without dead ends: 20730 [2025-03-16 15:15:52,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2053 GetRequests, 2050 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:15:52,801 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:15:52,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 85 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:15:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20730 states. [2025-03-16 15:15:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20730 to 19414. [2025-03-16 15:15:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19414 states, 19413 states have (on average 1.0163292638953279) internal successors, (19730), 19413 states have internal predecessors, (19730), 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-16 15:15:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19414 states to 19414 states and 19730 transitions. [2025-03-16 15:15:52,936 INFO L78 Accepts]: Start accepts. Automaton has 19414 states and 19730 transitions. Word has length 2050 [2025-03-16 15:15:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:15:52,937 INFO L471 AbstractCegarLoop]: Abstraction has 19414 states and 19730 transitions. [2025-03-16 15:15:52,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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-16 15:15:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 19414 states and 19730 transitions. [2025-03-16 15:15:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2214 [2025-03-16 15:15:52,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:15:52,961 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 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, 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, 3, 3, 3, 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] [2025-03-16 15:15:52,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 15:15:53,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 15:15:53,162 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:15:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:15:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2082072752, now seen corresponding path program 1 times [2025-03-16 15:15:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:15:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470749156] [2025-03-16 15:15:53,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:15:53,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2213 statements into 1 equivalence classes. [2025-03-16 15:15:53,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2213 of 2213 statements. [2025-03-16 15:15:53,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:53,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9931 backedges. 7290 proven. 91 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2025-03-16 15:15:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:15:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470749156] [2025-03-16 15:15:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470749156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:15:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240952075] [2025-03-16 15:15:55,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:15:55,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:15:55,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:15:55,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:15:55,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 15:15:55,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2213 statements into 1 equivalence classes. [2025-03-16 15:15:55,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2213 of 2213 statements. [2025-03-16 15:15:55,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:15:55,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:15:55,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 2553 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:15:55,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:15:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9931 backedges. 6559 proven. 269 refuted. 0 times theorem prover too weak. 3103 trivial. 0 not checked. [2025-03-16 15:15:59,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:16:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9931 backedges. 5753 proven. 0 refuted. 0 times theorem prover too weak. 4178 trivial. 0 not checked. [2025-03-16 15:16:02,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240952075] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:16:02,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:16:02,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-16 15:16:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417176759] [2025-03-16 15:16:02,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:16:02,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:16:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:16:02,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:16:02,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:16:02,170 INFO L87 Difference]: Start difference. First operand 19414 states and 19730 transitions. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 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)