./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_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/Problem12_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 fdbc0fdc55527506c6212fedb75f15bc177498c1e0d7baa5a0c1614f273a6557 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:56:39,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:56:39,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:56:39,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:56:39,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:56:39,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:56:39,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:56:39,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:56:39,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:56:39,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:56:39,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:56:39,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:56:39,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:56:39,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:56:39,482 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:56:39,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:56:39,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:56:39,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:56:39,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:56:39,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:56:39,484 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 -> fdbc0fdc55527506c6212fedb75f15bc177498c1e0d7baa5a0c1614f273a6557 [2025-03-16 14:56:39,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:56:39,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:56:39,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:56:39,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:56:39,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:56:39,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label41.c [2025-03-16 14:56:40,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2e5b7b29/7f3f2158a12c437ebedb70e200e064b2/FLAGfd799e1ce [2025-03-16 14:56:41,210 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:56:41,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label41.c [2025-03-16 14:56:41,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2e5b7b29/7f3f2158a12c437ebedb70e200e064b2/FLAGfd799e1ce [2025-03-16 14:56:41,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2e5b7b29/7f3f2158a12c437ebedb70e200e064b2 [2025-03-16 14:56:41,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:56:41,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:56:41,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:56:41,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:56:41,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:56:41,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:56:41" (1/1) ... [2025-03-16 14:56:41,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:41, skipping insertion in model container [2025-03-16 14:56:41,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:56:41" (1/1) ... [2025-03-16 14:56:41,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:56:41,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label41.c[6479,6492] [2025-03-16 14:56:42,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:56:42,069 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:56:42,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label41.c[6479,6492] [2025-03-16 14:56:42,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:56:42,342 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:56:42,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42 WrapperNode [2025-03-16 14:56:42,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:56:42,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:56:42,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:56:42,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:56:42,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,612 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:56:42,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:56:42,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:56:42,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:56:42,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:56:42,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,805 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 14:56:42,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:42,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:43,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:56:43,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:56:43,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:56:43,013 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:56:43,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (1/1) ... [2025-03-16 14:56:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:56:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:43,041 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 14:56:43,045 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 14:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:56:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:56:43,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:56:43,118 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:56:43,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:56:46,118 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:56:46,118 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:56:46,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:56:46,342 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:56:46,343 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:56:46,372 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:56:46,377 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:56:46,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:46 BoogieIcfgContainer [2025-03-16 14:56:46,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:56:46,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:56:46,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:56:46,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:56:46,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:56:41" (1/3) ... [2025-03-16 14:56:46,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1489c1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:46, skipping insertion in model container [2025-03-16 14:56:46,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:42" (2/3) ... [2025-03-16 14:56:46,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1489c1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:46, skipping insertion in model container [2025-03-16 14:56:46,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:46" (3/3) ... [2025-03-16 14:56:46,387 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label41.c [2025-03-16 14:56:46,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:56:46,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label41.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:56:46,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:56:46,484 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;@14323eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:56:46,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:56:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 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 14:56:46,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 14:56:46,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:46,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:46,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:46,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -748407510, now seen corresponding path program 1 times [2025-03-16 14:56:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:46,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738093841] [2025-03-16 14:56:46,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:46,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:56:46,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:56:46,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:46,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:46,602 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 14:56:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738093841] [2025-03-16 14:56:46,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738093841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:46,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:46,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:46,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959663450] [2025-03-16 14:56:46,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:46,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:56:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:46,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:56:46,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:56:46,624 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 14:56:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:46,700 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:56:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:56:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2025-03-16 14:56:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:46,716 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:56:46,716 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:56:46,723 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 14:56:46,724 INFO L435 NwaCegarLoop]: 1441 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, 1441 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 14:56:46,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:56:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:56:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:56:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 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 14:56:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:56:46,800 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 51 [2025-03-16 14:56:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:46,800 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:56:46,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 14:56:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:56:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 14:56:46,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:46,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:46,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:56:46,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:46,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 682989578, now seen corresponding path program 1 times [2025-03-16 14:56:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662087170] [2025-03-16 14:56:46,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:46,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 14:56:46,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 14:56:46,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:47,137 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 14:56:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662087170] [2025-03-16 14:56:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662087170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:47,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754355077] [2025-03-16 14:56:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:47,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:47,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:47,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:47,139 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 14:56:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:51,976 INFO L93 Difference]: Finished difference Result 3009 states and 5747 transitions. [2025-03-16 14:56:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:56:51,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2025-03-16 14:56:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:51,985 INFO L225 Difference]: With dead ends: 3009 [2025-03-16 14:56:51,985 INFO L226 Difference]: Without dead ends: 2256 [2025-03-16 14:56:51,987 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 14:56:51,987 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 2195 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:51,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 710 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-16 14:56:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-16 14:56:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2025-03-16 14:56:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5804878048780489) internal successors, (3564), 2255 states have internal predecessors, (3564), 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 14:56:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3564 transitions. [2025-03-16 14:56:52,041 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3564 transitions. Word has length 51 [2025-03-16 14:56:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:52,041 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3564 transitions. [2025-03-16 14:56:52,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 14:56:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3564 transitions. [2025-03-16 14:56:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 14:56:52,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:52,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:56:52,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:56:52,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:52,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1516552356, now seen corresponding path program 1 times [2025-03-16 14:56:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432893170] [2025-03-16 14:56:52,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:52,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 14:56:52,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 14:56:52,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:52,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:52,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432893170] [2025-03-16 14:56:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432893170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:52,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:52,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859887000] [2025-03-16 14:56:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:52,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:52,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:52,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:52,324 INFO L87 Difference]: Start difference. First operand 2256 states and 3564 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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 14:56:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:55,175 INFO L93 Difference]: Finished difference Result 5299 states and 9212 transitions. [2025-03-16 14:56:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:56:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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 122 [2025-03-16 14:56:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:55,186 INFO L225 Difference]: With dead ends: 5299 [2025-03-16 14:56:55,187 INFO L226 Difference]: Without dead ends: 3758 [2025-03-16 14:56:55,189 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 14:56:55,189 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 688 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:55,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 710 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 14:56:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2025-03-16 14:56:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3758. [2025-03-16 14:56:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.368645195634815) internal successors, (5142), 3757 states have internal predecessors, (5142), 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 14:56:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5142 transitions. [2025-03-16 14:56:55,241 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5142 transitions. Word has length 122 [2025-03-16 14:56:55,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:55,242 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5142 transitions. [2025-03-16 14:56:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 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 14:56:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5142 transitions. [2025-03-16 14:56:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 14:56:55,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:55,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:56:55,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:56:55,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 323103459, now seen corresponding path program 1 times [2025-03-16 14:56:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:55,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394606388] [2025-03-16 14:56:55,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:55,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:56:55,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:56:55,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:55,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:55,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:55,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394606388] [2025-03-16 14:56:55,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394606388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:55,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255796769] [2025-03-16 14:56:55,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:55,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:55,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:55,603 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 14:56:55,605 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 14:56:55,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:56:55,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:56:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:55,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:56:55,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 14:56:55,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:55,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255796769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:55,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:56:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99866402] [2025-03-16 14:56:55,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:55,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:55,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:55,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:55,884 INFO L87 Difference]: Start difference. First operand 3758 states and 5142 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 14:56:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:57,744 INFO L93 Difference]: Finished difference Result 9768 states and 13911 transitions. [2025-03-16 14:56:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:57,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 196 [2025-03-16 14:56:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:57,763 INFO L225 Difference]: With dead ends: 9768 [2025-03-16 14:56:57,763 INFO L226 Difference]: Without dead ends: 6762 [2025-03-16 14:56:57,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:57,769 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:57,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 401 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:56:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2025-03-16 14:56:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2025-03-16 14:56:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.2873835231474633) internal successors, (8704), 6761 states have internal predecessors, (8704), 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 14:56:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 8704 transitions. [2025-03-16 14:56:57,857 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 8704 transitions. Word has length 196 [2025-03-16 14:56:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:57,858 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 8704 transitions. [2025-03-16 14:56:57,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 14:56:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 8704 transitions. [2025-03-16 14:56:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 14:56:57,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:57,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:57,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:56:58,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:58,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:58,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash 779973017, now seen corresponding path program 1 times [2025-03-16 14:56:58,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:58,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450859068] [2025-03-16 14:56:58,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:58,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 14:56:58,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 14:56:58,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:58,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 14:56:58,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450859068] [2025-03-16 14:56:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450859068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:58,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492960931] [2025-03-16 14:56:58,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:58,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:58,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:58,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:58,422 INFO L87 Difference]: Start difference. First operand 6762 states and 8704 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 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 14:57:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:00,914 INFO L93 Difference]: Finished difference Result 15815 states and 21392 transitions. [2025-03-16 14:57:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:57:00,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 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 263 [2025-03-16 14:57:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:00,935 INFO L225 Difference]: With dead ends: 15815 [2025-03-16 14:57:00,935 INFO L226 Difference]: Without dead ends: 9768 [2025-03-16 14:57:00,939 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 14:57:00,940 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3465 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:00,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 490 Invalid, 4018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3465 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:57:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9768 states. [2025-03-16 14:57:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9768 to 9766. [2025-03-16 14:57:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.273015873015873) internal successors, (12431), 9765 states have internal predecessors, (12431), 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 14:57:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12431 transitions. [2025-03-16 14:57:01,045 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12431 transitions. Word has length 263 [2025-03-16 14:57:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:01,046 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12431 transitions. [2025-03-16 14:57:01,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 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 14:57:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12431 transitions. [2025-03-16 14:57:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 14:57:01,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:01,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:01,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:57:01,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:01,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:01,053 INFO L85 PathProgramCache]: Analyzing trace with hash -805819200, now seen corresponding path program 1 times [2025-03-16 14:57:01,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:01,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225864495] [2025-03-16 14:57:01,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:01,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 14:57:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 14:57:01,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:01,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 41 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225864495] [2025-03-16 14:57:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225864495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:57:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602545647] [2025-03-16 14:57:01,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:01,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:01,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:57:01,511 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 14:57:01,512 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 14:57:01,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 14:57:01,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 14:57:01,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:01,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:01,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:57:01,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:57:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:57:01,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:57:01,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602545647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:01,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:57:01,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-16 14:57:01,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704023876] [2025-03-16 14:57:01,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:01,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:01,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:01,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:57:01,702 INFO L87 Difference]: Start difference. First operand 9766 states and 12431 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 14:57:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:03,885 INFO L93 Difference]: Finished difference Result 24788 states and 32537 transitions. [2025-03-16 14:57:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:03,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 281 [2025-03-16 14:57:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:03,916 INFO L225 Difference]: With dead ends: 24788 [2025-03-16 14:57:03,916 INFO L226 Difference]: Without dead ends: 15774 [2025-03-16 14:57:03,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:57:03,926 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 715 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:03,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 573 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:57:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15774 states. [2025-03-16 14:57:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15774 to 15774. [2025-03-16 14:57:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.2572116908641349) internal successors, (19830), 15773 states have internal predecessors, (19830), 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 14:57:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 19830 transitions. [2025-03-16 14:57:04,100 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 19830 transitions. Word has length 281 [2025-03-16 14:57:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:04,100 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 19830 transitions. [2025-03-16 14:57:04,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 14:57:04,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 19830 transitions. [2025-03-16 14:57:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-16 14:57:04,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:04,107 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:04,113 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 14:57:04,307 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,SelfDestructingSolverStorable5 [2025-03-16 14:57:04,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:04,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash -212104532, now seen corresponding path program 1 times [2025-03-16 14:57:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709184384] [2025-03-16 14:57:04,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-16 14:57:04,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-16 14:57:04,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:04,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-16 14:57:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:04,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709184384] [2025-03-16 14:57:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709184384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:04,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:57:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637148650] [2025-03-16 14:57:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:04,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:04,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:04,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:04,554 INFO L87 Difference]: Start difference. First operand 15774 states and 19830 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 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 14:57:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:06,767 INFO L93 Difference]: Finished difference Result 44314 states and 56347 transitions. [2025-03-16 14:57:06,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:06,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 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 289 [2025-03-16 14:57:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:06,815 INFO L225 Difference]: With dead ends: 44314 [2025-03-16 14:57:06,816 INFO L226 Difference]: Without dead ends: 29292 [2025-03-16 14:57:06,833 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 14:57:06,834 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 690 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:06,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 421 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:57:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29292 states. [2025-03-16 14:57:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29292 to 26288. [2025-03-16 14:57:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26288 states, 26287 states have (on average 1.1972457868908586) internal successors, (31472), 26287 states have internal predecessors, (31472), 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 14:57:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26288 states to 26288 states and 31472 transitions. [2025-03-16 14:57:07,162 INFO L78 Accepts]: Start accepts. Automaton has 26288 states and 31472 transitions. Word has length 289 [2025-03-16 14:57:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:07,163 INFO L471 AbstractCegarLoop]: Abstraction has 26288 states and 31472 transitions. [2025-03-16 14:57:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 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 14:57:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26288 states and 31472 transitions. [2025-03-16 14:57:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-16 14:57:07,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:07,170 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:57:07,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:57:07,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:07,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -557790347, now seen corresponding path program 1 times [2025-03-16 14:57:07,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:07,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144440199] [2025-03-16 14:57:07,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:07,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-16 14:57:07,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-16 14:57:07,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:07,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-16 14:57:07,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144440199] [2025-03-16 14:57:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144440199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:07,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:07,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:07,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627140032] [2025-03-16 14:57:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:07,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:07,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:07,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:07,450 INFO L87 Difference]: Start difference. First operand 26288 states and 31472 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 14:57:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:09,721 INFO L93 Difference]: Finished difference Result 65342 states and 79631 transitions. [2025-03-16 14:57:09,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 402 [2025-03-16 14:57:09,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:09,776 INFO L225 Difference]: With dead ends: 65342 [2025-03-16 14:57:09,776 INFO L226 Difference]: Without dead ends: 39806 [2025-03-16 14:57:09,791 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 14:57:09,791 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 679 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:09,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1245 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:57:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39806 states. [2025-03-16 14:57:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39806 to 37553. [2025-03-16 14:57:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37553 states, 37552 states have (on average 1.167580954409885) internal successors, (43845), 37552 states have internal predecessors, (43845), 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 14:57:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37553 states to 37553 states and 43845 transitions. [2025-03-16 14:57:10,117 INFO L78 Accepts]: Start accepts. Automaton has 37553 states and 43845 transitions. Word has length 402 [2025-03-16 14:57:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:10,117 INFO L471 AbstractCegarLoop]: Abstraction has 37553 states and 43845 transitions. [2025-03-16 14:57:10,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 14:57:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37553 states and 43845 transitions. [2025-03-16 14:57:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-16 14:57:10,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:10,123 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:57:10,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:57:10,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:10,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1288658881, now seen corresponding path program 1 times [2025-03-16 14:57:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840125695] [2025-03-16 14:57:10,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:10,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-16 14:57:10,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-16 14:57:10,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:10,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-16 14:57:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:10,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840125695] [2025-03-16 14:57:10,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840125695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:10,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:10,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:10,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998722754] [2025-03-16 14:57:10,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:10,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:10,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:10,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:10,330 INFO L87 Difference]: Start difference. First operand 37553 states and 43845 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 14:57:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:12,560 INFO L93 Difference]: Finished difference Result 93880 states and 110827 transitions. [2025-03-16 14:57:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:12,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 406 [2025-03-16 14:57:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:12,631 INFO L225 Difference]: With dead ends: 93880 [2025-03-16 14:57:12,632 INFO L226 Difference]: Without dead ends: 57079 [2025-03-16 14:57:12,664 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 14:57:12,665 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 710 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 2832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:12,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1278 Invalid, 2832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:57:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57079 states. [2025-03-16 14:57:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57079 to 54826. [2025-03-16 14:57:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54826 states, 54825 states have (on average 1.1431828545371636) internal successors, (62675), 54825 states have internal predecessors, (62675), 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 14:57:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54826 states to 54826 states and 62675 transitions. [2025-03-16 14:57:13,325 INFO L78 Accepts]: Start accepts. Automaton has 54826 states and 62675 transitions. Word has length 406 [2025-03-16 14:57:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 54826 states and 62675 transitions. [2025-03-16 14:57:13,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 14:57:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 54826 states and 62675 transitions. [2025-03-16 14:57:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-16 14:57:13,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:13,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:57:13,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:57:13,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1091892661, now seen corresponding path program 1 times [2025-03-16 14:57:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801603007] [2025-03-16 14:57:13,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:13,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-16 14:57:13,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-16 14:57:13,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:13,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-16 14:57:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801603007] [2025-03-16 14:57:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801603007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:13,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341893871] [2025-03-16 14:57:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:13,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:13,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:13,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:13,544 INFO L87 Difference]: Start difference. First operand 54826 states and 62675 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 14:57:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:15,517 INFO L93 Difference]: Finished difference Result 121667 states and 138644 transitions. [2025-03-16 14:57:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 410 [2025-03-16 14:57:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:15,580 INFO L225 Difference]: With dead ends: 121667 [2025-03-16 14:57:15,581 INFO L226 Difference]: Without dead ends: 63087 [2025-03-16 14:57:15,601 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 14:57:15,601 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 743 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:15,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1314 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 14:57:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63087 states. [2025-03-16 14:57:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63087 to 61585. [2025-03-16 14:57:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61585 states, 61584 states have (on average 1.1265750844375162) internal successors, (69379), 61584 states have internal predecessors, (69379), 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 14:57:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61585 states to 61585 states and 69379 transitions. [2025-03-16 14:57:16,094 INFO L78 Accepts]: Start accepts. Automaton has 61585 states and 69379 transitions. Word has length 410 [2025-03-16 14:57:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:16,095 INFO L471 AbstractCegarLoop]: Abstraction has 61585 states and 69379 transitions. [2025-03-16 14:57:16,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 14:57:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 61585 states and 69379 transitions. [2025-03-16 14:57:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-16 14:57:16,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:16,100 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 14:57:16,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:57:16,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:16,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1628415473, now seen corresponding path program 1 times [2025-03-16 14:57:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753804461] [2025-03-16 14:57:16,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:16,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-16 14:57:16,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-16 14:57:16,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:16,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-16 14:57:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753804461] [2025-03-16 14:57:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753804461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:16,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:16,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342886217] [2025-03-16 14:57:16,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:16,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:16,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:16,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:16,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:16,417 INFO L87 Difference]: Start difference. First operand 61585 states and 69379 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 14:57:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:18,651 INFO L93 Difference]: Finished difference Result 147201 states and 167138 transitions. [2025-03-16 14:57:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:18,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 450 [2025-03-16 14:57:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:18,744 INFO L225 Difference]: With dead ends: 147201 [2025-03-16 14:57:18,744 INFO L226 Difference]: Without dead ends: 86368 [2025-03-16 14:57:18,759 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 14:57:18,759 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:18,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1256 Invalid, 2761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:57:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86368 states. [2025-03-16 14:57:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86368 to 78107. [2025-03-16 14:57:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78107 states, 78106 states have (on average 1.1131027065782397) internal successors, (86940), 78106 states have internal predecessors, (86940), 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 14:57:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78107 states to 78107 states and 86940 transitions. [2025-03-16 14:57:19,587 INFO L78 Accepts]: Start accepts. Automaton has 78107 states and 86940 transitions. Word has length 450 [2025-03-16 14:57:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:19,587 INFO L471 AbstractCegarLoop]: Abstraction has 78107 states and 86940 transitions. [2025-03-16 14:57:19,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 14:57:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 78107 states and 86940 transitions. [2025-03-16 14:57:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-16 14:57:19,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:19,608 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:19,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:57:19,608 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:19,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1473860812, now seen corresponding path program 1 times [2025-03-16 14:57:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:19,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102970130] [2025-03-16 14:57:19,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-16 14:57:19,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-16 14:57:19,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:19,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-16 14:57:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102970130] [2025-03-16 14:57:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102970130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:19,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:19,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096072808] [2025-03-16 14:57:19,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:19,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:19,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:19,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:19,872 INFO L87 Difference]: Start difference. First operand 78107 states and 86940 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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 14:57:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:21,947 INFO L93 Difference]: Finished difference Result 157715 states and 175429 transitions. [2025-03-16 14:57:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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 485 [2025-03-16 14:57:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:22,030 INFO L225 Difference]: With dead ends: 157715 [2025-03-16 14:57:22,030 INFO L226 Difference]: Without dead ends: 80360 [2025-03-16 14:57:22,069 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 14:57:22,070 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 700 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:22,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 990 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:57:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80360 states. [2025-03-16 14:57:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80360 to 75103. [2025-03-16 14:57:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75103 states, 75102 states have (on average 1.0923677132433225) internal successors, (82039), 75102 states have internal predecessors, (82039), 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 14:57:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75103 states to 75103 states and 82039 transitions. [2025-03-16 14:57:23,086 INFO L78 Accepts]: Start accepts. Automaton has 75103 states and 82039 transitions. Word has length 485 [2025-03-16 14:57:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:23,086 INFO L471 AbstractCegarLoop]: Abstraction has 75103 states and 82039 transitions. [2025-03-16 14:57:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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 14:57:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 75103 states and 82039 transitions. [2025-03-16 14:57:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-16 14:57:23,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:23,104 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:23,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:57:23,105 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1874910396, now seen corresponding path program 1 times [2025-03-16 14:57:23,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118419055] [2025-03-16 14:57:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:23,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-16 14:57:23,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-16 14:57:23,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:23,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-16 14:57:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118419055] [2025-03-16 14:57:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118419055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230492988] [2025-03-16 14:57:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:23,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:23,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:23,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:23,391 INFO L87 Difference]: Start difference. First operand 75103 states and 82039 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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 14:57:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:25,359 INFO L93 Difference]: Finished difference Result 150956 states and 164829 transitions. [2025-03-16 14:57:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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 572 [2025-03-16 14:57:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:25,433 INFO L225 Difference]: With dead ends: 150956 [2025-03-16 14:57:25,434 INFO L226 Difference]: Without dead ends: 76605 [2025-03-16 14:57:25,460 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 14:57:25,460 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 788 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:25,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 220 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:57:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76605 states. [2025-03-16 14:57:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76605 to 67593. [2025-03-16 14:57:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67593 states, 67592 states have (on average 1.074195171026157) internal successors, (72607), 67592 states have internal predecessors, (72607), 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 14:57:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67593 states to 67593 states and 72607 transitions. [2025-03-16 14:57:26,382 INFO L78 Accepts]: Start accepts. Automaton has 67593 states and 72607 transitions. Word has length 572 [2025-03-16 14:57:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:26,382 INFO L471 AbstractCegarLoop]: Abstraction has 67593 states and 72607 transitions. [2025-03-16 14:57:26,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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 14:57:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 67593 states and 72607 transitions. [2025-03-16 14:57:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-16 14:57:26,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:26,392 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:26,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:57:26,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -847919417, now seen corresponding path program 1 times [2025-03-16 14:57:26,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:26,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85025001] [2025-03-16 14:57:26,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:26,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-16 14:57:26,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-16 14:57:26,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:26,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-16 14:57:26,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:26,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85025001] [2025-03-16 14:57:26,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85025001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:26,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:26,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512844282] [2025-03-16 14:57:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:26,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:26,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:26,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:26,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:26,609 INFO L87 Difference]: Start difference. First operand 67593 states and 72607 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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 14:57:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:28,754 INFO L93 Difference]: Finished difference Result 155462 states and 168413 transitions. [2025-03-16 14:57:28,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:28,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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 594 [2025-03-16 14:57:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:28,852 INFO L225 Difference]: With dead ends: 155462 [2025-03-16 14:57:28,852 INFO L226 Difference]: Without dead ends: 88621 [2025-03-16 14:57:28,898 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 14:57:28,898 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 680 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:28,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1253 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:57:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88621 states. [2025-03-16 14:57:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88621 to 88621. [2025-03-16 14:57:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88621 states, 88620 states have (on average 1.0653915594673888) internal successors, (94415), 88620 states have internal predecessors, (94415), 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 14:57:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88621 states to 88621 states and 94415 transitions. [2025-03-16 14:57:29,925 INFO L78 Accepts]: Start accepts. Automaton has 88621 states and 94415 transitions. Word has length 594 [2025-03-16 14:57:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:29,925 INFO L471 AbstractCegarLoop]: Abstraction has 88621 states and 94415 transitions. [2025-03-16 14:57:29,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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 14:57:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 88621 states and 94415 transitions. [2025-03-16 14:57:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-03-16 14:57:29,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:29,935 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:29,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:57:29,936 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:29,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:29,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2109303509, now seen corresponding path program 1 times [2025-03-16 14:57:29,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:29,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523959328] [2025-03-16 14:57:29,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:29,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:29,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-03-16 14:57:29,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-03-16 14:57:29,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:29,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 14:57:30,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:30,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523959328] [2025-03-16 14:57:30,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523959328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:30,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:30,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:57:30,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391656229] [2025-03-16 14:57:30,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:30,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:57:30,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:30,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:57:30,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:57:30,747 INFO L87 Difference]: Start difference. First operand 88621 states and 94415 transitions. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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 14:57:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:34,427 INFO L93 Difference]: Finished difference Result 232064 states and 246919 transitions. [2025-03-16 14:57:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:57:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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 629 [2025-03-16 14:57:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:34,590 INFO L225 Difference]: With dead ends: 232064 [2025-03-16 14:57:34,590 INFO L226 Difference]: Without dead ends: 144195 [2025-03-16 14:57:34,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 14:57:34,657 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1403 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4372 mSolverCounterSat, 1072 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 5444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1072 IncrementalHoareTripleChecker+Valid, 4372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:34,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 69 Invalid, 5444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1072 Valid, 4372 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 14:57:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144195 states. [2025-03-16 14:57:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144195 to 133681. [2025-03-16 14:57:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133681 states, 133680 states have (on average 1.064751645721125) internal successors, (142336), 133680 states have internal predecessors, (142336), 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 14:57:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133681 states to 133681 states and 142336 transitions. [2025-03-16 14:57:36,117 INFO L78 Accepts]: Start accepts. Automaton has 133681 states and 142336 transitions. Word has length 629 [2025-03-16 14:57:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:36,117 INFO L471 AbstractCegarLoop]: Abstraction has 133681 states and 142336 transitions. [2025-03-16 14:57:36,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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 14:57:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 133681 states and 142336 transitions. [2025-03-16 14:57:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-03-16 14:57:36,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:36,130 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:36,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:57:36,131 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:36,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash -790297729, now seen corresponding path program 1 times [2025-03-16 14:57:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:36,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092261452] [2025-03-16 14:57:36,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:36,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-03-16 14:57:36,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-03-16 14:57:36,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:36,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-16 14:57:36,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092261452] [2025-03-16 14:57:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092261452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:57:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432194097] [2025-03-16 14:57:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:36,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:57:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:36,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:57:36,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:57:36,877 INFO L87 Difference]: Start difference. First operand 133681 states and 142336 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 14:57:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:40,812 INFO L93 Difference]: Finished difference Result 326690 states and 347572 transitions. [2025-03-16 14:57:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:57:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 651 [2025-03-16 14:57:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:41,035 INFO L225 Difference]: With dead ends: 326690 [2025-03-16 14:57:41,035 INFO L226 Difference]: Without dead ends: 193761 [2025-03-16 14:57:41,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 14:57:41,126 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1323 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4759 mSolverCounterSat, 987 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 987 IncrementalHoareTripleChecker+Valid, 4759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:41,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 138 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [987 Valid, 4759 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 14:57:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193761 states. [2025-03-16 14:57:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193761 to 180243. [2025-03-16 14:57:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180243 states, 180242 states have (on average 1.0630485680363067) internal successors, (191606), 180242 states have internal predecessors, (191606), 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 14:57:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180243 states to 180243 states and 191606 transitions. [2025-03-16 14:57:43,575 INFO L78 Accepts]: Start accepts. Automaton has 180243 states and 191606 transitions. Word has length 651 [2025-03-16 14:57:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:43,575 INFO L471 AbstractCegarLoop]: Abstraction has 180243 states and 191606 transitions. [2025-03-16 14:57:43,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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 14:57:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 180243 states and 191606 transitions. [2025-03-16 14:57:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-16 14:57:43,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:43,596 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:57:43,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:57:43,596 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:43,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:43,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1721295897, now seen corresponding path program 1 times [2025-03-16 14:57:43,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:43,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530532243] [2025-03-16 14:57:43,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:43,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:43,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-16 14:57:43,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-16 14:57:43,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:43,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 685 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-16 14:57:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530532243] [2025-03-16 14:57:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530532243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:44,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678442398] [2025-03-16 14:57:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:44,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:44,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:44,118 INFO L87 Difference]: Start difference. First operand 180243 states and 191606 transitions. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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 14:57:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:46,914 INFO L93 Difference]: Finished difference Result 431079 states and 457703 transitions. [2025-03-16 14:57:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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 663 [2025-03-16 14:57:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:47,476 INFO L225 Difference]: With dead ends: 431079 [2025-03-16 14:57:47,476 INFO L226 Difference]: Without dead ends: 251588 [2025-03-16 14:57:47,524 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 14:57:47,524 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 715 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:47,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 256 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:57:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251588 states. [2025-03-16 14:57:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251588 to 213287. [2025-03-16 14:57:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213287 states, 213286 states have (on average 1.0612885984077718) internal successors, (226358), 213286 states have internal predecessors, (226358), 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 14:57:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213287 states to 213287 states and 226358 transitions. [2025-03-16 14:57:50,485 INFO L78 Accepts]: Start accepts. Automaton has 213287 states and 226358 transitions. Word has length 663 [2025-03-16 14:57:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:50,485 INFO L471 AbstractCegarLoop]: Abstraction has 213287 states and 226358 transitions. [2025-03-16 14:57:50,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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 14:57:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 213287 states and 226358 transitions. [2025-03-16 14:57:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2025-03-16 14:57:50,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:50,511 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:57:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:57:50,511 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1591202393, now seen corresponding path program 1 times [2025-03-16 14:57:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405094046] [2025-03-16 14:57:50,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:50,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 771 statements into 1 equivalence classes. [2025-03-16 14:57:50,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 771 of 771 statements. [2025-03-16 14:57:50,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:50,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-16 14:57:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405094046] [2025-03-16 14:57:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405094046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:50,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:50,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171522941] [2025-03-16 14:57:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:50,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:50,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:50,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:50,724 INFO L87 Difference]: Start difference. First operand 213287 states and 226358 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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 14:57:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:53,909 INFO L93 Difference]: Finished difference Result 459617 states and 487668 transitions. [2025-03-16 14:57:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:53,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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 771 [2025-03-16 14:57:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:54,213 INFO L225 Difference]: With dead ends: 459617 [2025-03-16 14:57:54,213 INFO L226 Difference]: Without dead ends: 247082 [2025-03-16 14:57:54,273 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 14:57:54,273 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 573 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 671 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:54,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 953 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [671 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 14:57:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247082 states. [2025-03-16 14:57:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247082 to 223050. [2025-03-16 14:57:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223050 states, 223049 states have (on average 1.0592560379109524) internal successors, (236266), 223049 states have internal predecessors, (236266), 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 14:57:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223050 states to 223050 states and 236266 transitions. [2025-03-16 14:57:57,253 INFO L78 Accepts]: Start accepts. Automaton has 223050 states and 236266 transitions. Word has length 771 [2025-03-16 14:57:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:57,253 INFO L471 AbstractCegarLoop]: Abstraction has 223050 states and 236266 transitions. [2025-03-16 14:57:57,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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 14:57:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 223050 states and 236266 transitions. [2025-03-16 14:57:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2025-03-16 14:57:57,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:57,281 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:57:57,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:57:57,281 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:57,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash -881421486, now seen corresponding path program 1 times [2025-03-16 14:57:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768601939] [2025-03-16 14:57:57,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:57,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 805 statements into 1 equivalence classes. [2025-03-16 14:57:57,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 805 of 805 statements. [2025-03-16 14:57:57,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:57,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-03-16 14:57:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:58,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768601939] [2025-03-16 14:57:58,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768601939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:58,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:58,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:58,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391516469] [2025-03-16 14:57:58,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:58,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:58,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:58,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:58,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:58,088 INFO L87 Difference]: Start difference. First operand 223050 states and 236266 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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)