./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label14.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37136c333282e67f438e7bf13fb35b60043f7970afe7b0fb63a25a209e0dddcf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:12:40,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:12:40,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:12:40,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:12:40,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:12:40,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:12:40,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:12:40,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:12:40,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:12:40,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:12:40,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:12:40,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:12:40,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:12:40,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:12:40,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:12:40,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:12:40,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:12:40,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:12:40,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:12:40,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:12:40,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:12:40,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:12:40,491 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 -> 37136c333282e67f438e7bf13fb35b60043f7970afe7b0fb63a25a209e0dddcf [2025-03-16 15:12:40,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:12:40,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:12:40,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:12:40,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:12:40,736 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:12:40,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label14.c [2025-03-16 15:12:41,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba7d052/05fbfdad48ce40c1be92a83d474f608e/FLAG33c9160b3 [2025-03-16 15:12:42,300 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:12:42,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label14.c [2025-03-16 15:12:42,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba7d052/05fbfdad48ce40c1be92a83d474f608e/FLAG33c9160b3 [2025-03-16 15:12:42,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba7d052/05fbfdad48ce40c1be92a83d474f608e [2025-03-16 15:12:42,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:12:42,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:12:42,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:12:42,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:12:42,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:12:42,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:42,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e5392a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42, skipping insertion in model container [2025-03-16 15:12:42,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:42,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:12:42,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label14.c[2092,2105] [2025-03-16 15:12:42,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:12:42,827 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:12:42,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label14.c[2092,2105] [2025-03-16 15:12:42,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:12:42,972 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:12:42,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42 WrapperNode [2025-03-16 15:12:42,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:12:42,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:12:42,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:12:42,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:12:42,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,105 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-16 15:12:43,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:12:43,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:12:43,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:12:43,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:12:43,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:12:43,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:12:43,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:12:43,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:12:43,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:12:43,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (1/1) ... [2025-03-16 15:12:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:12:43,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:12:43,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:12:43,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:12:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:12:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:12:43,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:12:43,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:12:43,369 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:12:43,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:12:44,997 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-16 15:12:45,065 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-16 15:12:45,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:12:45,083 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:12:45,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:12:45,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:45 BoogieIcfgContainer [2025-03-16 15:12:45,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:12:45,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:12:45,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:12:45,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:12:45,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:12:42" (1/3) ... [2025-03-16 15:12:45,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7735f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:12:45, skipping insertion in model container [2025-03-16 15:12:45,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:12:42" (2/3) ... [2025-03-16 15:12:45,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7735f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:12:45, skipping insertion in model container [2025-03-16 15:12:45,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:12:45" (3/3) ... [2025-03-16 15:12:45,096 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label14.c [2025-03-16 15:12:45,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:12:45,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label14.c that has 1 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:12:45,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:12:45,177 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;@77065e2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:12:45,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:12:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 15:12:45,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:45,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:45,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:45,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash 668073558, now seen corresponding path program 1 times [2025-03-16 15:12:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160309621] [2025-03-16 15:12:45,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:45,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:45,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 15:12:45,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 15:12:45,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:45,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160309621] [2025-03-16 15:12:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160309621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:45,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:45,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:45,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769825541] [2025-03-16 15:12:45,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:45,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:12:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:45,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:12:45,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:12:45,339 INFO L87 Difference]: Start difference. First operand has 335 states, 333 states have (on average 1.984984984984985) internal successors, (661), 334 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:45,383 INFO L93 Difference]: Finished difference Result 669 states and 1321 transitions. [2025-03-16 15:12:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:12:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2025-03-16 15:12:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:45,393 INFO L225 Difference]: With dead ends: 669 [2025-03-16 15:12:45,393 INFO L226 Difference]: Without dead ends: 332 [2025-03-16 15:12:45,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:12:45,400 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:45,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:12:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-16 15:12:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-16 15:12:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2025-03-16 15:12:45,457 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 17 [2025-03-16 15:12:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:45,457 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2025-03-16 15:12:45,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2025-03-16 15:12:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 15:12:45,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:45,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:45,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:12:45,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:45,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1142827242, now seen corresponding path program 1 times [2025-03-16 15:12:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903081269] [2025-03-16 15:12:45,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:45,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 15:12:45,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 15:12:45,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:45,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:45,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:45,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903081269] [2025-03-16 15:12:45,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903081269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:45,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:45,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175691624] [2025-03-16 15:12:45,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:45,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:45,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:45,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:45,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:45,571 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:46,779 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2025-03-16 15:12:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:46,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2025-03-16 15:12:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:46,782 INFO L225 Difference]: With dead ends: 992 [2025-03-16 15:12:46,782 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 15:12:46,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:46,784 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 338 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:46,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 157 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:12:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 15:12:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-16 15:12:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5833333333333333) internal successors, (1045), 660 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1045 transitions. [2025-03-16 15:12:46,817 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1045 transitions. Word has length 17 [2025-03-16 15:12:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:46,817 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1045 transitions. [2025-03-16 15:12:46,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1045 transitions. [2025-03-16 15:12:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 15:12:46,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:46,819 INFO L218 NwaCegarLoop]: trace histogram [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 15:12:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:12:46,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2026249620, now seen corresponding path program 1 times [2025-03-16 15:12:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639085990] [2025-03-16 15:12:46,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:46,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 15:12:46,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 15:12:46,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:46,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:12:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639085990] [2025-03-16 15:12:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639085990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:46,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066429328] [2025-03-16 15:12:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:46,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:46,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:46,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:46,993 INFO L87 Difference]: Start difference. First operand 661 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:48,131 INFO L93 Difference]: Finished difference Result 1979 states and 3132 transitions. [2025-03-16 15:12:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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 88 [2025-03-16 15:12:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:48,137 INFO L225 Difference]: With dead ends: 1979 [2025-03-16 15:12:48,137 INFO L226 Difference]: Without dead ends: 1319 [2025-03-16 15:12:48,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:48,139 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 277 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:48,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 78 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:12:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-03-16 15:12:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2025-03-16 15:12:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.5060698027314112) internal successors, (1985), 1318 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1985 transitions. [2025-03-16 15:12:48,162 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1985 transitions. Word has length 88 [2025-03-16 15:12:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:48,163 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1985 transitions. [2025-03-16 15:12:48,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1985 transitions. [2025-03-16 15:12:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-16 15:12:48,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:48,166 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:48,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:12:48,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:48,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1429267030, now seen corresponding path program 1 times [2025-03-16 15:12:48,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251026156] [2025-03-16 15:12:48,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:48,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-16 15:12:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-16 15:12:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 15:12:48,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:48,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251026156] [2025-03-16 15:12:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251026156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:48,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:48,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258893465] [2025-03-16 15:12:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:48,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:48,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:48,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:48,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:48,362 INFO L87 Difference]: Start difference. First operand 1319 states and 1985 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:49,412 INFO L93 Difference]: Finished difference Result 3953 states and 5952 transitions. [2025-03-16 15:12:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-03-16 15:12:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:49,419 INFO L225 Difference]: With dead ends: 3953 [2025-03-16 15:12:49,419 INFO L226 Difference]: Without dead ends: 2635 [2025-03-16 15:12:49,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:49,421 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:49,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 204 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:12:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-03-16 15:12:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2025-03-16 15:12:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.323842065299924) internal successors, (3487), 2634 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3487 transitions. [2025-03-16 15:12:49,458 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3487 transitions. Word has length 159 [2025-03-16 15:12:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:49,458 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3487 transitions. [2025-03-16 15:12:49,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3487 transitions. [2025-03-16 15:12:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 15:12:49,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:49,461 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:49,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:12:49,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:49,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash -736875670, now seen corresponding path program 1 times [2025-03-16 15:12:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822195564] [2025-03-16 15:12:49,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:49,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 15:12:49,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 15:12:49,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:49,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 15:12:49,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:49,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822195564] [2025-03-16 15:12:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822195564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390601450] [2025-03-16 15:12:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:49,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:49,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:49,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:49,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:49,658 INFO L87 Difference]: Start difference. First operand 2635 states and 3487 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:50,564 INFO L93 Difference]: Finished difference Result 6585 states and 8890 transitions. [2025-03-16 15:12:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 183 [2025-03-16 15:12:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:50,575 INFO L225 Difference]: With dead ends: 6585 [2025-03-16 15:12:50,575 INFO L226 Difference]: Without dead ends: 3951 [2025-03-16 15:12:50,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:50,578 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:50,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:12:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-16 15:12:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 2964. [2025-03-16 15:12:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2964 states, 2963 states have (on average 1.3287208909888626) internal successors, (3937), 2963 states have internal predecessors, (3937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2964 states and 3937 transitions. [2025-03-16 15:12:50,622 INFO L78 Accepts]: Start accepts. Automaton has 2964 states and 3937 transitions. Word has length 183 [2025-03-16 15:12:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:50,622 INFO L471 AbstractCegarLoop]: Abstraction has 2964 states and 3937 transitions. [2025-03-16 15:12:50,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2964 states and 3937 transitions. [2025-03-16 15:12:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-16 15:12:50,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:50,626 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 15:12:50,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:12:50,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:50,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash -370192596, now seen corresponding path program 1 times [2025-03-16 15:12:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:50,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811109474] [2025-03-16 15:12:50,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:50,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-16 15:12:50,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-16 15:12:50,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:50,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 15:12:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:50,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811109474] [2025-03-16 15:12:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811109474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:50,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686543551] [2025-03-16 15:12:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:50,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:50,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:50,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:50,827 INFO L87 Difference]: Start difference. First operand 2964 states and 3937 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:51,687 INFO L93 Difference]: Finished difference Result 7243 states and 9441 transitions. [2025-03-16 15:12:51,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:51,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 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 326 [2025-03-16 15:12:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:51,698 INFO L225 Difference]: With dead ends: 7243 [2025-03-16 15:12:51,698 INFO L226 Difference]: Without dead ends: 4280 [2025-03-16 15:12:51,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:51,701 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:51,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 82 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2025-03-16 15:12:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2025-03-16 15:12:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2121991119420426) internal successors, (5187), 4279 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5187 transitions. [2025-03-16 15:12:51,750 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5187 transitions. Word has length 326 [2025-03-16 15:12:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:51,750 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5187 transitions. [2025-03-16 15:12:51,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5187 transitions. [2025-03-16 15:12:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-16 15:12:51,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:51,759 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:51,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:12:51,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:51,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1901091983, now seen corresponding path program 1 times [2025-03-16 15:12:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896440635] [2025-03-16 15:12:51,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:51,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-16 15:12:51,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-16 15:12:51,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:51,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 15:12:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896440635] [2025-03-16 15:12:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896440635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:52,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:12:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129503085] [2025-03-16 15:12:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:52,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:52,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:52,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:52,347 INFO L87 Difference]: Start difference. First operand 4280 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:53,226 INFO L93 Difference]: Finished difference Result 9217 states and 11085 transitions. [2025-03-16 15:12:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:53,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 2 states have internal predecessors, (359), 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 440 [2025-03-16 15:12:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:53,237 INFO L225 Difference]: With dead ends: 9217 [2025-03-16 15:12:53,237 INFO L226 Difference]: Without dead ends: 4938 [2025-03-16 15:12:53,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:53,240 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:53,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 247 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2025-03-16 15:12:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4938. [2025-03-16 15:12:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.1912092363783675) internal successors, (5881), 4937 states have internal predecessors, (5881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 5881 transitions. [2025-03-16 15:12:53,300 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 5881 transitions. Word has length 440 [2025-03-16 15:12:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:53,300 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 5881 transitions. [2025-03-16 15:12:53,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 5881 transitions. [2025-03-16 15:12:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-16 15:12:53,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:53,308 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:53,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:12:53,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -43706503, now seen corresponding path program 1 times [2025-03-16 15:12:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268291033] [2025-03-16 15:12:53,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:53,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-16 15:12:53,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-16 15:12:53,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:53,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-16 15:12:53,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268291033] [2025-03-16 15:12:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268291033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:53,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:53,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:12:53,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615210611] [2025-03-16 15:12:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:53,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 15:12:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:53,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 15:12:53,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:53,980 INFO L87 Difference]: Start difference. First operand 4938 states and 5881 transitions. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:55,467 INFO L93 Difference]: Finished difference Result 9076 states and 10914 transitions. [2025-03-16 15:12:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 15:12:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 527 [2025-03-16 15:12:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:55,479 INFO L225 Difference]: With dead ends: 9076 [2025-03-16 15:12:55,479 INFO L226 Difference]: Without dead ends: 4609 [2025-03-16 15:12:55,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:12:55,482 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 307 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:55,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 284 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:12:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2025-03-16 15:12:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4609. [2025-03-16 15:12:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 4608 states have (on average 1.0735677083333333) internal successors, (4947), 4608 states have internal predecessors, (4947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 4947 transitions. [2025-03-16 15:12:55,532 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 4947 transitions. Word has length 527 [2025-03-16 15:12:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:55,532 INFO L471 AbstractCegarLoop]: Abstraction has 4609 states and 4947 transitions. [2025-03-16 15:12:55,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 4947 transitions. [2025-03-16 15:12:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-16 15:12:55,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:55,538 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:12:55,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:12:55,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:55,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1413609431, now seen corresponding path program 1 times [2025-03-16 15:12:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:55,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380036334] [2025-03-16 15:12:55,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:55,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-16 15:12:55,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-16 15:12:55,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:55,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 15:12:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380036334] [2025-03-16 15:12:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380036334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:56,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631022085] [2025-03-16 15:12:56,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:12:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:56,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:12:56,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:56,201 INFO L87 Difference]: Start difference. First operand 4609 states and 4947 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:57,058 INFO L93 Difference]: Finished difference Result 8559 states and 9224 transitions. [2025-03-16 15:12:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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 555 [2025-03-16 15:12:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:57,076 INFO L225 Difference]: With dead ends: 8559 [2025-03-16 15:12:57,076 INFO L226 Difference]: Without dead ends: 4609 [2025-03-16 15:12:57,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:12:57,081 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 205 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:57,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 117 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:12:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2025-03-16 15:12:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4609. [2025-03-16 15:12:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 4608 states have (on average 1.0724826388888888) internal successors, (4942), 4608 states have internal predecessors, (4942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 4942 transitions. [2025-03-16 15:12:57,149 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 4942 transitions. Word has length 555 [2025-03-16 15:12:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:57,150 INFO L471 AbstractCegarLoop]: Abstraction has 4609 states and 4942 transitions. [2025-03-16 15:12:57,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 4942 transitions. [2025-03-16 15:12:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-03-16 15:12:57,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:57,156 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:12:57,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:12:57,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:57,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash -383739865, now seen corresponding path program 1 times [2025-03-16 15:12:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:57,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045619368] [2025-03-16 15:12:57,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:57,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-16 15:12:57,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-16 15:12:57,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:57,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-16 15:12:57,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:57,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045619368] [2025-03-16 15:12:57,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045619368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:57,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:57,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843698122] [2025-03-16 15:12:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:57,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:57,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:57,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:57,598 INFO L87 Difference]: Start difference. First operand 4609 states and 4942 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:58,269 INFO L93 Difference]: Finished difference Result 10862 states and 11772 transitions. [2025-03-16 15:12:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:58,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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 659 [2025-03-16 15:12:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:58,281 INFO L225 Difference]: With dead ends: 10862 [2025-03-16 15:12:58,281 INFO L226 Difference]: Without dead ends: 6912 [2025-03-16 15:12:58,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:58,285 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:58,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 39 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2025-03-16 15:12:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 6583. [2025-03-16 15:12:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 6582 states have (on average 1.0771801883925858) internal successors, (7090), 6582 states have internal predecessors, (7090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 7090 transitions. [2025-03-16 15:12:58,351 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 7090 transitions. Word has length 659 [2025-03-16 15:12:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:58,352 INFO L471 AbstractCegarLoop]: Abstraction has 6583 states and 7090 transitions. [2025-03-16 15:12:58,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 7090 transitions. [2025-03-16 15:12:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2025-03-16 15:12:58,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:58,361 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:58,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:12:58,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:58,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1818622701, now seen corresponding path program 1 times [2025-03-16 15:12:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705722875] [2025-03-16 15:12:58,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:58,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-03-16 15:12:58,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-03-16 15:12:58,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:58,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 912 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-03-16 15:12:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705722875] [2025-03-16 15:12:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705722875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473224144] [2025-03-16 15:12:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:58,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:58,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:58,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:58,759 INFO L87 Difference]: Start difference. First operand 6583 states and 7090 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:12:59,457 INFO L93 Difference]: Finished difference Result 14810 states and 16068 transitions. [2025-03-16 15:12:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:12:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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 875 [2025-03-16 15:12:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:12:59,471 INFO L225 Difference]: With dead ends: 14810 [2025-03-16 15:12:59,471 INFO L226 Difference]: Without dead ends: 8886 [2025-03-16 15:12:59,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:59,477 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:12:59,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 433 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:12:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2025-03-16 15:12:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 8557. [2025-03-16 15:12:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8557 states, 8556 states have (on average 1.0649836372136512) internal successors, (9112), 8556 states have internal predecessors, (9112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 9112 transitions. [2025-03-16 15:12:59,567 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 9112 transitions. Word has length 875 [2025-03-16 15:12:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:12:59,568 INFO L471 AbstractCegarLoop]: Abstraction has 8557 states and 9112 transitions. [2025-03-16 15:12:59,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:12:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 9112 transitions. [2025-03-16 15:12:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2025-03-16 15:12:59,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:12:59,577 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:12:59,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:12:59,578 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:12:59,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:12:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash 406683957, now seen corresponding path program 1 times [2025-03-16 15:12:59,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:12:59,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306833694] [2025-03-16 15:12:59,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:12:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:12:59,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 876 statements into 1 equivalence classes. [2025-03-16 15:12:59,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 876 of 876 statements. [2025-03-16 15:12:59,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:12:59,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:12:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-03-16 15:12:59,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:12:59,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306833694] [2025-03-16 15:12:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306833694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:12:59,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:12:59,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:12:59,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105465139] [2025-03-16 15:12:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:12:59,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:12:59,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:12:59,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:12:59,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:12:59,949 INFO L87 Difference]: Start difference. First operand 8557 states and 9112 transitions. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:00,526 INFO L93 Difference]: Finished difference Result 20732 states and 22226 transitions. [2025-03-16 15:13:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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 876 [2025-03-16 15:13:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:00,544 INFO L225 Difference]: With dead ends: 20732 [2025-03-16 15:13:00,544 INFO L226 Difference]: Without dead ends: 11847 [2025-03-16 15:13:00,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:00,553 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:00,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 426 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2025-03-16 15:13:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 11518. [2025-03-16 15:13:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11518 states, 11517 states have (on average 1.053399322740297) internal successors, (12132), 11517 states have internal predecessors, (12132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 12132 transitions. [2025-03-16 15:13:00,644 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 12132 transitions. Word has length 876 [2025-03-16 15:13:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:00,645 INFO L471 AbstractCegarLoop]: Abstraction has 11518 states and 12132 transitions. [2025-03-16 15:13:00,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 12132 transitions. [2025-03-16 15:13:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2025-03-16 15:13:00,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:00,655 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:00,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:13:00,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:00,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash -478780429, now seen corresponding path program 1 times [2025-03-16 15:13:00,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:00,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959899447] [2025-03-16 15:13:00,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:00,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 928 statements into 1 equivalence classes. [2025-03-16 15:13:00,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 928 of 928 statements. [2025-03-16 15:13:00,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:00,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2025-03-16 15:13:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959899447] [2025-03-16 15:13:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959899447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642043776] [2025-03-16 15:13:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:01,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:01,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:01,062 INFO L87 Difference]: Start difference. First operand 11518 states and 12132 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:01,668 INFO L93 Difference]: Finished difference Result 22706 states and 23929 transitions. [2025-03-16 15:13:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:01,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 928 [2025-03-16 15:13:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:01,683 INFO L225 Difference]: With dead ends: 22706 [2025-03-16 15:13:01,683 INFO L226 Difference]: Without dead ends: 11518 [2025-03-16 15:13:01,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:01,692 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 317 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:01,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 425 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2025-03-16 15:13:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 10860. [2025-03-16 15:13:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.0371120729348928) internal successors, (11262), 10859 states have internal predecessors, (11262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11262 transitions. [2025-03-16 15:13:01,773 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11262 transitions. Word has length 928 [2025-03-16 15:13:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:01,774 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11262 transitions. [2025-03-16 15:13:01,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11262 transitions. [2025-03-16 15:13:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2025-03-16 15:13:01,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:01,785 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:01,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:13:01,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:01,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1273235205, now seen corresponding path program 1 times [2025-03-16 15:13:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480394177] [2025-03-16 15:13:01,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:01,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1001 statements into 1 equivalence classes. [2025-03-16 15:13:01,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1001 of 1001 statements. [2025-03-16 15:13:01,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:01,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 470 proven. 674 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-16 15:13:02,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480394177] [2025-03-16 15:13:02,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480394177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46661146] [2025-03-16 15:13:02,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:02,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:02,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:02,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:02,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:13:02,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1001 statements into 1 equivalence classes. [2025-03-16 15:13:02,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1001 of 1001 statements. [2025-03-16 15:13:02,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:02,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:02,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:02,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 727 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-16 15:13:03,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46661146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:13:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454629060] [2025-03-16 15:13:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:03,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:03,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:03,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:03,317 INFO L87 Difference]: Start difference. First operand 10860 states and 11262 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:03,848 INFO L93 Difference]: Finished difference Result 21061 states and 21859 transitions. [2025-03-16 15:13:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 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 1001 [2025-03-16 15:13:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:03,861 INFO L225 Difference]: With dead ends: 21061 [2025-03-16 15:13:03,862 INFO L226 Difference]: Without dead ends: 10860 [2025-03-16 15:13:03,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1005 GetRequests, 1001 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:03,869 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:03,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 375 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2025-03-16 15:13:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 10860. [2025-03-16 15:13:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10860 states, 10859 states have (on average 1.0335205820057096) internal successors, (11223), 10859 states have internal predecessors, (11223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 11223 transitions. [2025-03-16 15:13:03,945 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 11223 transitions. Word has length 1001 [2025-03-16 15:13:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:03,946 INFO L471 AbstractCegarLoop]: Abstraction has 10860 states and 11223 transitions. [2025-03-16 15:13:03,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 11223 transitions. [2025-03-16 15:13:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2025-03-16 15:13:03,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:03,957 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:03,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:13:04,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 15:13:04,158 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:04,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:04,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1185949243, now seen corresponding path program 1 times [2025-03-16 15:13:04,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:04,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204331621] [2025-03-16 15:13:04,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:04,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1120 statements into 1 equivalence classes. [2025-03-16 15:13:04,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1120 of 1120 statements. [2025-03-16 15:13:04,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:04,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1722 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2025-03-16 15:13:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204331621] [2025-03-16 15:13:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204331621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232920874] [2025-03-16 15:13:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:04,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:04,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:04,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:04,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:04,593 INFO L87 Difference]: Start difference. First operand 10860 states and 11223 transitions. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:05,135 INFO L93 Difference]: Finished difference Result 23364 states and 24239 transitions. [2025-03-16 15:13:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:05,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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 1120 [2025-03-16 15:13:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:05,147 INFO L225 Difference]: With dead ends: 23364 [2025-03-16 15:13:05,148 INFO L226 Difference]: Without dead ends: 13163 [2025-03-16 15:13:05,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:05,155 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:05,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 423 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2025-03-16 15:13:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 13163. [2025-03-16 15:13:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0294028263181887) internal successors, (13549), 13162 states have internal predecessors, (13549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13549 transitions. [2025-03-16 15:13:05,256 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13549 transitions. Word has length 1120 [2025-03-16 15:13:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:05,256 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13549 transitions. [2025-03-16 15:13:05,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13549 transitions. [2025-03-16 15:13:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2025-03-16 15:13:05,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:05,270 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:05,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:13:05,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:05,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash -138486531, now seen corresponding path program 1 times [2025-03-16 15:13:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:05,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526666248] [2025-03-16 15:13:05,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:05,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:05,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1159 statements into 1 equivalence classes. [2025-03-16 15:13:05,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1159 of 1159 statements. [2025-03-16 15:13:05,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:05,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2152 backedges. 1513 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2025-03-16 15:13:06,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:06,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526666248] [2025-03-16 15:13:06,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526666248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:06,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:06,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:06,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886388674] [2025-03-16 15:13:06,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:06,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:06,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:06,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:06,301 INFO L87 Difference]: Start difference. First operand 13163 states and 13549 transitions. Second operand has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:07,146 INFO L93 Difference]: Finished difference Result 25677 states and 26443 transitions. [2025-03-16 15:13:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:13:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 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 1159 [2025-03-16 15:13:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:07,157 INFO L225 Difference]: With dead ends: 25677 [2025-03-16 15:13:07,157 INFO L226 Difference]: Without dead ends: 13173 [2025-03-16 15:13:07,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:07,165 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:07,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 442 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:13:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13173 states. [2025-03-16 15:13:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13173 to 12834. [2025-03-16 15:13:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12834 states, 12833 states have (on average 1.0294553105275461) internal successors, (13211), 12833 states have internal predecessors, (13211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12834 states to 12834 states and 13211 transitions. [2025-03-16 15:13:07,256 INFO L78 Accepts]: Start accepts. Automaton has 12834 states and 13211 transitions. Word has length 1159 [2025-03-16 15:13:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:07,256 INFO L471 AbstractCegarLoop]: Abstraction has 12834 states and 13211 transitions. [2025-03-16 15:13:07,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 12834 states and 13211 transitions. [2025-03-16 15:13:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1175 [2025-03-16 15:13:07,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:07,271 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:07,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:13:07,271 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:07,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1611719918, now seen corresponding path program 1 times [2025-03-16 15:13:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:07,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037097357] [2025-03-16 15:13:07,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:07,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1174 statements into 1 equivalence classes. [2025-03-16 15:13:07,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1174 of 1174 statements. [2025-03-16 15:13:07,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:07,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1471 proven. 0 refuted. 0 times theorem prover too weak. 1313 trivial. 0 not checked. [2025-03-16 15:13:08,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037097357] [2025-03-16 15:13:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037097357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636150356] [2025-03-16 15:13:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:08,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:08,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:08,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:08,102 INFO L87 Difference]: Start difference. First operand 12834 states and 13211 transitions. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 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 15:13:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:08,718 INFO L93 Difference]: Finished difference Result 25667 states and 26426 transitions. [2025-03-16 15:13:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 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 1174 [2025-03-16 15:13:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:08,729 INFO L225 Difference]: With dead ends: 25667 [2025-03-16 15:13:08,729 INFO L226 Difference]: Without dead ends: 13492 [2025-03-16 15:13:08,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:08,737 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:08,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 437 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2025-03-16 15:13:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13492. [2025-03-16 15:13:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.0283892965680825) internal successors, (13874), 13491 states have internal predecessors, (13874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 13874 transitions. [2025-03-16 15:13:08,863 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 13874 transitions. Word has length 1174 [2025-03-16 15:13:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:08,863 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 13874 transitions. [2025-03-16 15:13:08,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 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 15:13:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 13874 transitions. [2025-03-16 15:13:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2025-03-16 15:13:08,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:08,885 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:08,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:13:08,886 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:08,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:08,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1300735085, now seen corresponding path program 1 times [2025-03-16 15:13:08,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:08,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2684389] [2025-03-16 15:13:08,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:08,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1199 statements into 1 equivalence classes. [2025-03-16 15:13:09,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1199 of 1199 statements. [2025-03-16 15:13:09,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:09,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 1609 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2025-03-16 15:13:09,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:09,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2684389] [2025-03-16 15:13:09,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2684389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:09,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:13:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519600464] [2025-03-16 15:13:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:09,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:13:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:09,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:13:09,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:13:09,674 INFO L87 Difference]: Start difference. First operand 13492 states and 13874 transitions. Second operand has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:10,364 INFO L93 Difference]: Finished difference Result 26325 states and 27083 transitions. [2025-03-16 15:13:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:13:10,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 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 1199 [2025-03-16 15:13:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:10,375 INFO L225 Difference]: With dead ends: 26325 [2025-03-16 15:13:10,375 INFO L226 Difference]: Without dead ends: 13492 [2025-03-16 15:13:10,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:13:10,383 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:10,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 561 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2025-03-16 15:13:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13492. [2025-03-16 15:13:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13492 states, 13491 states have (on average 1.0274998146912757) internal successors, (13862), 13491 states have internal predecessors, (13862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 13862 transitions. [2025-03-16 15:13:10,481 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 13862 transitions. Word has length 1199 [2025-03-16 15:13:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 13492 states and 13862 transitions. [2025-03-16 15:13:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 13862 transitions. [2025-03-16 15:13:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2025-03-16 15:13:10,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:10,493 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:10,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:13:10,493 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:10,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:10,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1522042643, now seen corresponding path program 1 times [2025-03-16 15:13:10,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:10,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580621870] [2025-03-16 15:13:10,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:10,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1228 statements into 1 equivalence classes. [2025-03-16 15:13:10,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1228 of 1228 statements. [2025-03-16 15:13:10,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:10,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2788 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-16 15:13:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580621870] [2025-03-16 15:13:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580621870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:10,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:10,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55854860] [2025-03-16 15:13:10,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:10,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:10,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:10,978 INFO L87 Difference]: Start difference. First operand 13492 states and 13862 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:11,547 INFO L93 Difference]: Finished difference Result 29286 states and 30165 transitions. [2025-03-16 15:13:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:11,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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 1228 [2025-03-16 15:13:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:11,560 INFO L225 Difference]: With dead ends: 29286 [2025-03-16 15:13:11,560 INFO L226 Difference]: Without dead ends: 14479 [2025-03-16 15:13:11,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:11,570 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 147 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:11,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 411 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2025-03-16 15:13:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 14479. [2025-03-16 15:13:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.0259704379057881) internal successors, (14854), 14478 states have internal predecessors, (14854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14854 transitions. [2025-03-16 15:13:11,676 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14854 transitions. Word has length 1228 [2025-03-16 15:13:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:11,676 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14854 transitions. [2025-03-16 15:13:11,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14854 transitions. [2025-03-16 15:13:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2025-03-16 15:13:11,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:11,718 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:11,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:13:11,718 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:11,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1351095309, now seen corresponding path program 1 times [2025-03-16 15:13:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666785420] [2025-03-16 15:13:11,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1321 statements into 1 equivalence classes. [2025-03-16 15:13:11,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1321 of 1321 statements. [2025-03-16 15:13:11,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:11,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2940 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2025-03-16 15:13:12,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666785420] [2025-03-16 15:13:12,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666785420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:12,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:12,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:12,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513604191] [2025-03-16 15:13:12,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:12,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:12,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:12,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:12,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:12,233 INFO L87 Difference]: Start difference. First operand 14479 states and 14854 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:12,831 INFO L93 Difference]: Finished difference Result 29615 states and 30386 transitions. [2025-03-16 15:13:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 1321 [2025-03-16 15:13:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:12,843 INFO L225 Difference]: With dead ends: 29615 [2025-03-16 15:13:12,843 INFO L226 Difference]: Without dead ends: 14150 [2025-03-16 15:13:12,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:12,851 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 318 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:12,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 414 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2025-03-16 15:13:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 12505. [2025-03-16 15:13:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0203934740882918) internal successors, (12759), 12504 states have internal predecessors, (12759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 12759 transitions. [2025-03-16 15:13:12,971 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 12759 transitions. Word has length 1321 [2025-03-16 15:13:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:12,972 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 12759 transitions. [2025-03-16 15:13:12,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 12759 transitions. [2025-03-16 15:13:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1440 [2025-03-16 15:13:12,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:12,998 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:13:12,998 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash -143349571, now seen corresponding path program 1 times [2025-03-16 15:13:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817870876] [2025-03-16 15:13:12,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:13,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1439 statements into 1 equivalence classes. [2025-03-16 15:13:13,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1439 of 1439 statements. [2025-03-16 15:13:13,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:13,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3913 backedges. 1185 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-16 15:13:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817870876] [2025-03-16 15:13:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817870876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:13,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:13,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061098171] [2025-03-16 15:13:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:13,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:13,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:13,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:13,643 INFO L87 Difference]: Start difference. First operand 12505 states and 12759 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:14,228 INFO L93 Difference]: Finished difference Result 24680 states and 25186 transitions. [2025-03-16 15:13:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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 1439 [2025-03-16 15:13:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:14,238 INFO L225 Difference]: With dead ends: 24680 [2025-03-16 15:13:14,238 INFO L226 Difference]: Without dead ends: 12505 [2025-03-16 15:13:14,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:14,245 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 139 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:14,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 403 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2025-03-16 15:13:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12505. [2025-03-16 15:13:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0152751119641714) internal successors, (12695), 12504 states have internal predecessors, (12695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 12695 transitions. [2025-03-16 15:13:14,328 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 12695 transitions. Word has length 1439 [2025-03-16 15:13:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:14,328 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 12695 transitions. [2025-03-16 15:13:14,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 12695 transitions. [2025-03-16 15:13:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1768 [2025-03-16 15:13:14,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:14,346 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:14,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:13:14,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:14,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1343338619, now seen corresponding path program 1 times [2025-03-16 15:13:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110833105] [2025-03-16 15:13:14,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:14,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1767 statements into 1 equivalence classes. [2025-03-16 15:13:14,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1767 of 1767 statements. [2025-03-16 15:13:14,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:14,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5350 backedges. 2964 proven. 66 refuted. 0 times theorem prover too weak. 2320 trivial. 0 not checked. [2025-03-16 15:13:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110833105] [2025-03-16 15:13:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110833105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855785381] [2025-03-16 15:13:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:15,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:15,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:13:15,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1767 statements into 1 equivalence classes. [2025-03-16 15:13:16,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1767 of 1767 statements. [2025-03-16 15:13:16,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:16,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:16,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:13:16,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5350 backedges. 2376 proven. 201 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2025-03-16 15:13:18,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:13:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5350 backedges. 2376 proven. 201 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2025-03-16 15:13:20,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855785381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:13:20,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:13:20,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-16 15:13:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913113652] [2025-03-16 15:13:20,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:13:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:13:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:20,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:13:20,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:13:20,962 INFO L87 Difference]: Start difference. First operand 12505 states and 12695 transitions. Second operand has 9 states, 9 states have (on average 198.44444444444446) internal successors, (1786), 8 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:24,447 INFO L93 Difference]: Finished difference Result 34550 states and 35103 transitions. [2025-03-16 15:13:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:13:24,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 198.44444444444446) internal successors, (1786), 8 states have internal predecessors, (1786), 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 1767 [2025-03-16 15:13:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:24,468 INFO L225 Difference]: With dead ends: 34550 [2025-03-16 15:13:24,468 INFO L226 Difference]: Without dead ends: 22704 [2025-03-16 15:13:24,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3544 GetRequests, 3529 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-16 15:13:24,474 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2021 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6079 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 6079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:24,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 75 Invalid, 6418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 6079 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-16 15:13:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22704 states. [2025-03-16 15:13:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22704 to 17111. [2025-03-16 15:13:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17111 states, 17110 states have (on average 1.015020455873758) internal successors, (17367), 17110 states have internal predecessors, (17367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 17367 transitions. [2025-03-16 15:13:24,603 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 17367 transitions. Word has length 1767 [2025-03-16 15:13:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:24,604 INFO L471 AbstractCegarLoop]: Abstraction has 17111 states and 17367 transitions. [2025-03-16 15:13:24,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 198.44444444444446) internal successors, (1786), 8 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 17367 transitions. [2025-03-16 15:13:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1861 [2025-03-16 15:13:24,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:24,628 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:24,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:13:24,829 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,SelfDestructingSolverStorable21 [2025-03-16 15:13:24,829 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:24,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash 625421364, now seen corresponding path program 1 times [2025-03-16 15:13:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:24,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16374715] [2025-03-16 15:13:24,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:24,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1860 statements into 1 equivalence classes. [2025-03-16 15:13:24,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1860 of 1860 statements. [2025-03-16 15:13:24,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6312 backedges. 3360 proven. 0 refuted. 0 times theorem prover too weak. 2952 trivial. 0 not checked. [2025-03-16 15:13:26,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:26,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16374715] [2025-03-16 15:13:26,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16374715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:26,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:26,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768603803] [2025-03-16 15:13:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:26,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:26,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:26,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:26,459 INFO L87 Difference]: Start difference. First operand 17111 states and 17367 transitions. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:27,040 INFO L93 Difference]: Finished difference Result 35866 states and 36410 transitions. [2025-03-16 15:13:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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 1860 [2025-03-16 15:13:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:27,056 INFO L225 Difference]: With dead ends: 35866 [2025-03-16 15:13:27,056 INFO L226 Difference]: Without dead ends: 19414 [2025-03-16 15:13:27,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:27,065 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 206 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:27,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 42 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19414 states. [2025-03-16 15:13:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19414 to 17769. [2025-03-16 15:13:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.014745610085547) internal successors, (18030), 17768 states have internal predecessors, (18030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18030 transitions. [2025-03-16 15:13:27,188 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18030 transitions. Word has length 1860 [2025-03-16 15:13:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:27,189 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18030 transitions. [2025-03-16 15:13:27,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18030 transitions. [2025-03-16 15:13:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1902 [2025-03-16 15:13:27,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:27,250 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:13:27,250 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1794020422, now seen corresponding path program 1 times [2025-03-16 15:13:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778700332] [2025-03-16 15:13:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:27,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1901 statements into 1 equivalence classes. [2025-03-16 15:13:27,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1901 of 1901 statements. [2025-03-16 15:13:27,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:27,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 5172 proven. 41 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2025-03-16 15:13:29,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778700332] [2025-03-16 15:13:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778700332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439181033] [2025-03-16 15:13:29,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:29,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:29,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:29,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:29,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:13:29,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1901 statements into 1 equivalence classes. [2025-03-16 15:13:29,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1901 of 1901 statements. [2025-03-16 15:13:29,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:29,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 2206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:13:29,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 3830 proven. 0 refuted. 0 times theorem prover too weak. 3165 trivial. 0 not checked. [2025-03-16 15:13:30,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439181033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:13:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966765631] [2025-03-16 15:13:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:30,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:30,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:30,310 INFO L87 Difference]: Start difference. First operand 17769 states and 18030 transitions. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:30,841 INFO L93 Difference]: Finished difference Result 34879 states and 35397 transitions. [2025-03-16 15:13:30,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:30,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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 1901 [2025-03-16 15:13:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:30,854 INFO L225 Difference]: With dead ends: 34879 [2025-03-16 15:13:30,854 INFO L226 Difference]: Without dead ends: 17769 [2025-03-16 15:13:30,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1905 GetRequests, 1901 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:13:30,863 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:30,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 416 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2025-03-16 15:13:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17769. [2025-03-16 15:13:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17769 states, 17768 states have (on average 1.014576767221972) internal successors, (18027), 17768 states have internal predecessors, (18027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17769 states to 17769 states and 18027 transitions. [2025-03-16 15:13:30,983 INFO L78 Accepts]: Start accepts. Automaton has 17769 states and 18027 transitions. Word has length 1901 [2025-03-16 15:13:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 17769 states and 18027 transitions. [2025-03-16 15:13:30,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 17769 states and 18027 transitions. [2025-03-16 15:13:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2158 [2025-03-16 15:13:31,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:31,010 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:31,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:13:31,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:31,210 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -531624261, now seen corresponding path program 1 times [2025-03-16 15:13:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347070771] [2025-03-16 15:13:31,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:31,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2157 statements into 1 equivalence classes. [2025-03-16 15:13:31,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2157 of 2157 statements. [2025-03-16 15:13:31,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:31,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9761 backedges. 1920 proven. 0 refuted. 0 times theorem prover too weak. 7841 trivial. 0 not checked. [2025-03-16 15:13:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347070771] [2025-03-16 15:13:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347070771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:31,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:13:31,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:13:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427255164] [2025-03-16 15:13:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:31,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:31,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:31,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:31,937 INFO L87 Difference]: Start difference. First operand 17769 states and 18027 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:32,540 INFO L93 Difference]: Finished difference Result 36853 states and 37399 transitions. [2025-03-16 15:13:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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 2157 [2025-03-16 15:13:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:32,557 INFO L225 Difference]: With dead ends: 36853 [2025-03-16 15:13:32,557 INFO L226 Difference]: Without dead ends: 19743 [2025-03-16 15:13:32,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:13:32,568 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 138 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:32,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 414 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19743 states. [2025-03-16 15:13:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19743 to 19414. [2025-03-16 15:13:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19414 states, 19413 states have (on average 1.0142687889558544) internal successors, (19690), 19413 states have internal predecessors, (19690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19414 states to 19414 states and 19690 transitions. [2025-03-16 15:13:32,765 INFO L78 Accepts]: Start accepts. Automaton has 19414 states and 19690 transitions. Word has length 2157 [2025-03-16 15:13:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:32,767 INFO L471 AbstractCegarLoop]: Abstraction has 19414 states and 19690 transitions. [2025-03-16 15:13:32,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 19414 states and 19690 transitions. [2025-03-16 15:13:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2205 [2025-03-16 15:13:32,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:32,822 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:32,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:13:32,822 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:32,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 584179771, now seen corresponding path program 1 times [2025-03-16 15:13:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393345804] [2025-03-16 15:13:32,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:32,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2204 statements into 1 equivalence classes. [2025-03-16 15:13:33,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2204 of 2204 statements. [2025-03-16 15:13:33,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:33,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:35,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 6977 proven. 153 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2025-03-16 15:13:35,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:35,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393345804] [2025-03-16 15:13:35,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393345804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:35,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172412393] [2025-03-16 15:13:35,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:35,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:35,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:35,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:35,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:13:35,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2204 statements into 1 equivalence classes. [2025-03-16 15:13:35,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2204 of 2204 statements. [2025-03-16 15:13:35,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:35,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:35,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:13:35,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5604 proven. 0 refuted. 0 times theorem prover too weak. 4396 trivial. 0 not checked. [2025-03-16 15:13:35,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:35,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172412393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:35,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:35,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:13:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377572264] [2025-03-16 15:13:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:35,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:35,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:35,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:35,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:35,546 INFO L87 Difference]: Start difference. First operand 19414 states and 19690 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:36,172 INFO L93 Difference]: Finished difference Result 40143 states and 40720 transitions. [2025-03-16 15:13:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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 2204 [2025-03-16 15:13:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:36,190 INFO L225 Difference]: With dead ends: 40143 [2025-03-16 15:13:36,191 INFO L226 Difference]: Without dead ends: 21388 [2025-03-16 15:13:36,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2209 GetRequests, 2204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:36,201 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:36,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 414 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:13:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21388 states. [2025-03-16 15:13:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21388 to 20401. [2025-03-16 15:13:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20401 states, 20400 states have (on average 1.0138725490196079) internal successors, (20683), 20400 states have internal predecessors, (20683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20401 states to 20401 states and 20683 transitions. [2025-03-16 15:13:36,419 INFO L78 Accepts]: Start accepts. Automaton has 20401 states and 20683 transitions. Word has length 2204 [2025-03-16 15:13:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:36,420 INFO L471 AbstractCegarLoop]: Abstraction has 20401 states and 20683 transitions. [2025-03-16 15:13:36,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20401 states and 20683 transitions. [2025-03-16 15:13:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2329 [2025-03-16 15:13:36,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:36,478 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:36,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:13:36,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 15:13:36,679 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:36,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash 826210240, now seen corresponding path program 1 times [2025-03-16 15:13:36,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:36,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864971635] [2025-03-16 15:13:36,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:36,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:36,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2328 statements into 1 equivalence classes. [2025-03-16 15:13:36,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2328 of 2328 statements. [2025-03-16 15:13:36,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:36,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10622 backedges. 7517 proven. 153 refuted. 0 times theorem prover too weak. 2952 trivial. 0 not checked. [2025-03-16 15:13:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864971635] [2025-03-16 15:13:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864971635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692378992] [2025-03-16 15:13:39,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:39,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:39,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:39,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:39,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:13:39,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2328 statements into 1 equivalence classes. [2025-03-16 15:13:39,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2328 of 2328 statements. [2025-03-16 15:13:39,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:39,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:39,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 2647 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:13:39,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10622 backedges. 3729 proven. 0 refuted. 0 times theorem prover too weak. 6893 trivial. 0 not checked. [2025-03-16 15:13:40,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:13:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692378992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:13:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:13:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:13:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287681351] [2025-03-16 15:13:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:13:40,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:13:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:13:40,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:13:40,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:40,068 INFO L87 Difference]: Start difference. First operand 20401 states and 20683 transitions. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:13:40,704 INFO L93 Difference]: Finished difference Result 40801 states and 41366 transitions. [2025-03-16 15:13:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:13:40,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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 2328 [2025-03-16 15:13:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:13:40,721 INFO L225 Difference]: With dead ends: 40801 [2025-03-16 15:13:40,721 INFO L226 Difference]: Without dead ends: 21059 [2025-03-16 15:13:40,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2333 GetRequests, 2328 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:13:40,731 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:13:40,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 23 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:13:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21059 states. [2025-03-16 15:13:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21059 to 20072. [2025-03-16 15:13:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20072 states, 20071 states have (on average 1.0136017139155997) internal successors, (20344), 20071 states have internal predecessors, (20344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20072 states to 20072 states and 20344 transitions. [2025-03-16 15:13:40,871 INFO L78 Accepts]: Start accepts. Automaton has 20072 states and 20344 transitions. Word has length 2328 [2025-03-16 15:13:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:13:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 20072 states and 20344 transitions. [2025-03-16 15:13:40,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:13:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20072 states and 20344 transitions. [2025-03-16 15:13:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2395 [2025-03-16 15:13:40,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:13:40,902 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:13:40,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:13:41,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 15:13:41,103 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:13:41,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:13:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash 588757637, now seen corresponding path program 1 times [2025-03-16 15:13:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:13:41,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979978756] [2025-03-16 15:13:41,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:41,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:13:41,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2394 statements into 1 equivalence classes. [2025-03-16 15:13:41,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2394 of 2394 statements. [2025-03-16 15:13:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 7811 proven. 153 refuted. 0 times theorem prover too weak. 3091 trivial. 0 not checked. [2025-03-16 15:13:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:13:43,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979978756] [2025-03-16 15:13:43,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979978756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:13:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007972280] [2025-03-16 15:13:43,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:13:43,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:13:43,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:13:43,737 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:13:43,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:13:43,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2394 statements into 1 equivalence classes. [2025-03-16 15:13:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2394 of 2394 statements. [2025-03-16 15:13:44,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:13:44,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:13:44,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 2713 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:13:44,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:13:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 7259 proven. 67 refuted. 0 times theorem prover too weak. 3729 trivial. 0 not checked. [2025-03-16 15:13:57,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:14:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 6158 proven. 0 refuted. 0 times theorem prover too weak. 4897 trivial. 0 not checked. [2025-03-16 15:14:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007972280] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:14:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:14:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-16 15:14:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062250745] [2025-03-16 15:14:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:14:00,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:14:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:14:00,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:14:00,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:14:00,931 INFO L87 Difference]: Start difference. First operand 20072 states and 20344 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)