./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label16.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/Problem13_label16.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 8b5d267cd1e473b445c52ec06f60f3c8a73f12a2c5a7f8cdb18f8745b90aa156 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:00:13,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:00:13,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:00:13,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:00:13,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:00:13,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:00:13,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:00:13,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:00:13,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:00:13,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:00:13,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:00:13,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:00:13,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:00:13,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:00:13,354 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:00:13,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:00:13,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:00:13,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:00:13,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:00:13,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:00:13,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:00:13,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:00:13,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:00:13,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:00:13,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:00:13,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:00:13,357 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 -> 8b5d267cd1e473b445c52ec06f60f3c8a73f12a2c5a7f8cdb18f8745b90aa156 [2025-03-16 15:00:13,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:00:13,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:00:13,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:00:13,586 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:00:13,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:00:13,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label16.c [2025-03-16 15:00:14,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae1fd2541/41e415a0a5ad41af81849ea8d26960f8/FLAG0e2b2dbb8 [2025-03-16 15:00:15,256 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:00:15,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label16.c [2025-03-16 15:00:15,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae1fd2541/41e415a0a5ad41af81849ea8d26960f8/FLAG0e2b2dbb8 [2025-03-16 15:00:15,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae1fd2541/41e415a0a5ad41af81849ea8d26960f8 [2025-03-16 15:00:15,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:00:15,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:00:15,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:00:15,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:00:15,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:00:15,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:00:15" (1/1) ... [2025-03-16 15:00:15,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14571a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:15, skipping insertion in model container [2025-03-16 15:00:15,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:00:15" (1/1) ... [2025-03-16 15:00:15,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:00:16,094 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/Problem13_label16.c[3388,3401] [2025-03-16 15:00:16,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:00:16,649 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:00:16,660 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/Problem13_label16.c[3388,3401] [2025-03-16 15:00:16,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:00:16,970 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:00:16,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16 WrapperNode [2025-03-16 15:00:16,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:00:16,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:00:16,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:00:16,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:00:16,977 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:00:16" (1/1) ... [2025-03-16 15:00:17,021 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:00:16" (1/1) ... [2025-03-16 15:00:17,318 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:00:17,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:00:17,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:00:17,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:00:17,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:00:17,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,603 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:00:17,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:00:17,848 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:00:17,848 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:00:17,849 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:00:17,849 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (1/1) ... [2025-03-16 15:00:17,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:00:17,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:17,877 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:00:17,879 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:00:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:00:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:00:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:00:17,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:00:17,948 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:00:17,949 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:00:22,048 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:00:22,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:00:22,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:00:22,292 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:00:22,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:00:22,338 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:00:22,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:00:22,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:00:22 BoogieIcfgContainer [2025-03-16 15:00:22,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:00:22,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:00:22,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:00:22,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:00:22,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:00:15" (1/3) ... [2025-03-16 15:00:22,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238da76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:00:22, skipping insertion in model container [2025-03-16 15:00:22,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:16" (2/3) ... [2025-03-16 15:00:22,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238da76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:00:22, skipping insertion in model container [2025-03-16 15:00:22,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:00:22" (3/3) ... [2025-03-16 15:00:22,347 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label16.c [2025-03-16 15:00:22,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:00:22,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label16.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:00:22,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:00:22,468 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;@3bd3d9ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:00:22,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:00:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states 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:00:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 15:00:22,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:22,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:22,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash -306567518, now seen corresponding path program 1 times [2025-03-16 15:00:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168593846] [2025-03-16 15:00:22,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:22,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 15:00:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 15:00:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:22,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:22,606 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:00:22,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:22,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168593846] [2025-03-16 15:00:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168593846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:22,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:22,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:22,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686378518] [2025-03-16 15:00:22,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:22,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:00:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:22,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:00:22,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:00:22,632 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:00:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:22,710 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:00:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:00:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-16 15:00:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:22,728 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:00:22,728 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:00:22,732 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:00:22,734 INFO L435 NwaCegarLoop]: 1879 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, 1879 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:00:22,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:00:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:00:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:00:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states 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:00:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:00:22,818 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 21 [2025-03-16 15:00:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:00:22,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:00:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:00:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 15:00:22,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:22,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:22,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:00:22,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash -764213342, now seen corresponding path program 1 times [2025-03-16 15:00:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:22,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217916923] [2025-03-16 15:00:22,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:22,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:22,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 15:00:22,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 15:00:22,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:22,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:22,963 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:00:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:22,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217916923] [2025-03-16 15:00:22,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217916923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:22,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:22,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:22,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340839263] [2025-03-16 15:00:22,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:22,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:22,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:22,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:22,966 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:00:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:26,251 INFO L93 Difference]: Finished difference Result 2996 states and 5467 transitions. [2025-03-16 15:00:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-16 15:00:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:26,261 INFO L225 Difference]: With dead ends: 2996 [2025-03-16 15:00:26,262 INFO L226 Difference]: Without dead ends: 1963 [2025-03-16 15:00:26,263 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:00:26,264 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 1133 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:26,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 941 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 15:00:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2025-03-16 15:00:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1950. [2025-03-16 15:00:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 1.6541816316059517) internal successors, (3224), 1949 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states 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:00:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 3224 transitions. [2025-03-16 15:00:26,320 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 3224 transitions. Word has length 21 [2025-03-16 15:00:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:26,320 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 3224 transitions. [2025-03-16 15:00:26,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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:00:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 3224 transitions. [2025-03-16 15:00:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 15:00:26,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:26,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:26,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:00:26,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:26,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash 385225700, now seen corresponding path program 1 times [2025-03-16 15:00:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:26,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890107549] [2025-03-16 15:00:26,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:26,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:26,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 15:00:26,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 15:00:26,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:26,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:26,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:26,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890107549] [2025-03-16 15:00:26,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890107549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:26,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:26,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823059091] [2025-03-16 15:00:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:26,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:26,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:26,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:26,528 INFO L87 Difference]: Start difference. First operand 1950 states and 3224 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:00:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:29,603 INFO L93 Difference]: Finished difference Result 5539 states and 9220 transitions. [2025-03-16 15:00:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:29,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 15:00:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:29,619 INFO L225 Difference]: With dead ends: 5539 [2025-03-16 15:00:29,619 INFO L226 Difference]: Without dead ends: 3590 [2025-03-16 15:00:29,622 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:00:29,623 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 923 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:29,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 15:00:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2025-03-16 15:00:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3580. [2025-03-16 15:00:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3579 states have (on average 1.5051690416317407) internal successors, (5387), 3579 states have internal predecessors, (5387), 0 states have call successors, (0), 0 states 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:00:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5387 transitions. [2025-03-16 15:00:29,680 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5387 transitions. Word has length 92 [2025-03-16 15:00:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:29,681 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5387 transitions. [2025-03-16 15:00:29,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:00:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5387 transitions. [2025-03-16 15:00:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 15:00:29,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:29,683 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:00:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:00:29,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 54092573, now seen corresponding path program 1 times [2025-03-16 15:00:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524672253] [2025-03-16 15:00:29,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:29,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 15:00:29,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 15:00:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524672253] [2025-03-16 15:00:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524672253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:29,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505538937] [2025-03-16 15:00:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:29,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:29,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:29,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:29,850 INFO L87 Difference]: Start difference. First operand 3580 states and 5387 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:00:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:32,488 INFO L93 Difference]: Finished difference Result 10351 states and 15624 transitions. [2025-03-16 15:00:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:32,489 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 106 [2025-03-16 15:00:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:32,507 INFO L225 Difference]: With dead ends: 10351 [2025-03-16 15:00:32,508 INFO L226 Difference]: Without dead ends: 6772 [2025-03-16 15:00:32,513 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:00:32,515 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:32,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1170 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:00:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2025-03-16 15:00:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 6748. [2025-03-16 15:00:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6748 states, 6747 states have (on average 1.3253297761968281) internal successors, (8942), 6747 states have internal predecessors, (8942), 0 states have call successors, (0), 0 states 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:00:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6748 states to 6748 states and 8942 transitions. [2025-03-16 15:00:32,607 INFO L78 Accepts]: Start accepts. Automaton has 6748 states and 8942 transitions. Word has length 106 [2025-03-16 15:00:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:32,607 INFO L471 AbstractCegarLoop]: Abstraction has 6748 states and 8942 transitions. [2025-03-16 15:00:32,608 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:00:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6748 states and 8942 transitions. [2025-03-16 15:00:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 15:00:32,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:32,612 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:00:32,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:00:32,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:32,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1584928652, now seen corresponding path program 1 times [2025-03-16 15:00:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:32,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036931464] [2025-03-16 15:00:32,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:32,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 15:00:32,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 15:00:32,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:32,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:32,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:32,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036931464] [2025-03-16 15:00:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036931464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:32,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681773667] [2025-03-16 15:00:32,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:32,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:32,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:32,789 INFO L87 Difference]: Start difference. First operand 6748 states and 8942 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:00:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:35,569 INFO L93 Difference]: Finished difference Result 19870 states and 26318 transitions. [2025-03-16 15:00:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:35,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-16 15:00:35,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:35,605 INFO L225 Difference]: With dead ends: 19870 [2025-03-16 15:00:35,605 INFO L226 Difference]: Without dead ends: 13123 [2025-03-16 15:00:35,611 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:00:35,611 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 899 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 3432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:35,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 610 Invalid, 3432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:00:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2025-03-16 15:00:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 13113. [2025-03-16 15:00:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13113 states, 13112 states have (on average 1.275549115314216) internal successors, (16725), 13112 states have internal predecessors, (16725), 0 states have call successors, (0), 0 states 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:00:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13113 states to 13113 states and 16725 transitions. [2025-03-16 15:00:35,799 INFO L78 Accepts]: Start accepts. Automaton has 13113 states and 16725 transitions. Word has length 135 [2025-03-16 15:00:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:35,799 INFO L471 AbstractCegarLoop]: Abstraction has 13113 states and 16725 transitions. [2025-03-16 15:00:35,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:00:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13113 states and 16725 transitions. [2025-03-16 15:00:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 15:00:35,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:35,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:35,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:00:35,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:35,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:35,806 INFO L85 PathProgramCache]: Analyzing trace with hash 806838979, now seen corresponding path program 1 times [2025-03-16 15:00:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791910952] [2025-03-16 15:00:35,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:35,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 15:00:35,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 15:00:35,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:35,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-16 15:00:36,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:36,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791910952] [2025-03-16 15:00:36,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791910952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:36,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:36,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:36,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263441438] [2025-03-16 15:00:36,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:36,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:36,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:36,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:36,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:36,059 INFO L87 Difference]: Start difference. First operand 13113 states and 16725 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:38,622 INFO L93 Difference]: Finished difference Result 36460 states and 47022 transitions. [2025-03-16 15:00:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-03-16 15:00:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:38,665 INFO L225 Difference]: With dead ends: 36460 [2025-03-16 15:00:38,666 INFO L226 Difference]: Without dead ends: 24135 [2025-03-16 15:00:38,680 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:00:38,682 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 849 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:38,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1032 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:00:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24135 states. [2025-03-16 15:00:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24135 to 24129. [2025-03-16 15:00:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24129 states, 24128 states have (on average 1.2020888594164456) internal successors, (29004), 24128 states have internal predecessors, (29004), 0 states have call successors, (0), 0 states 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:00:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24129 states to 24129 states and 29004 transitions. [2025-03-16 15:00:39,066 INFO L78 Accepts]: Start accepts. Automaton has 24129 states and 29004 transitions. Word has length 218 [2025-03-16 15:00:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:39,066 INFO L471 AbstractCegarLoop]: Abstraction has 24129 states and 29004 transitions. [2025-03-16 15:00:39,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 24129 states and 29004 transitions. [2025-03-16 15:00:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 15:00:39,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:39,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:39,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:00:39,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:39,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -531244207, now seen corresponding path program 1 times [2025-03-16 15:00:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410244456] [2025-03-16 15:00:39,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 15:00:39,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 15:00:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 15:00:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410244456] [2025-03-16 15:00:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410244456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:39,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:39,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567372206] [2025-03-16 15:00:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:39,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:39,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:39,332 INFO L87 Difference]: Start difference. First operand 24129 states and 29004 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:00:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:41,585 INFO L93 Difference]: Finished difference Result 43519 states and 52822 transitions. [2025-03-16 15:00:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 222 [2025-03-16 15:00:41,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:41,615 INFO L225 Difference]: With dead ends: 43519 [2025-03-16 15:00:41,615 INFO L226 Difference]: Without dead ends: 24130 [2025-03-16 15:00:41,633 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:00:41,634 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 676 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:41,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1212 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:00:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24130 states. [2025-03-16 15:00:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24130 to 24129. [2025-03-16 15:00:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24129 states, 24128 states have (on average 1.2018816312997347) internal successors, (28999), 24128 states have internal predecessors, (28999), 0 states have call successors, (0), 0 states 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:00:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24129 states to 24129 states and 28999 transitions. [2025-03-16 15:00:41,847 INFO L78 Accepts]: Start accepts. Automaton has 24129 states and 28999 transitions. Word has length 222 [2025-03-16 15:00:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:41,848 INFO L471 AbstractCegarLoop]: Abstraction has 24129 states and 28999 transitions. [2025-03-16 15:00:41,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:00:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24129 states and 28999 transitions. [2025-03-16 15:00:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-16 15:00:41,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:41,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:41,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:00:41,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:41,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 888249669, now seen corresponding path program 1 times [2025-03-16 15:00:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119681159] [2025-03-16 15:00:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:41,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 15:00:41,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 15:00:41,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:41,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119681159] [2025-03-16 15:00:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119681159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003172181] [2025-03-16 15:00:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:42,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:42,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:42,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:42,036 INFO L87 Difference]: Start difference. First operand 24129 states and 28999 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:00:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:44,964 INFO L93 Difference]: Finished difference Result 47313 states and 56986 transitions. [2025-03-16 15:00:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:44,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2025-03-16 15:00:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:44,990 INFO L225 Difference]: With dead ends: 47313 [2025-03-16 15:00:44,991 INFO L226 Difference]: Without dead ends: 23972 [2025-03-16 15:00:45,010 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:00:45,011 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 1037 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:45,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1655 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:00:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23972 states. [2025-03-16 15:00:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23972 to 23967. [2025-03-16 15:00:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23967 states, 23966 states have (on average 1.1344404573145288) internal successors, (27188), 23966 states have internal predecessors, (27188), 0 states have call successors, (0), 0 states 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:00:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23967 states to 23967 states and 27188 transitions. [2025-03-16 15:00:45,234 INFO L78 Accepts]: Start accepts. Automaton has 23967 states and 27188 transitions. Word has length 235 [2025-03-16 15:00:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 23967 states and 27188 transitions. [2025-03-16 15:00:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states 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:00:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23967 states and 27188 transitions. [2025-03-16 15:00:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 15:00:45,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:45,238 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 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:00:45,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:00:45,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:45,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1179263592, now seen corresponding path program 1 times [2025-03-16 15:00:45,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:45,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325533519] [2025-03-16 15:00:45,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:45,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:45,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 15:00:45,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 15:00:45,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 15:00:45,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:45,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325533519] [2025-03-16 15:00:45,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325533519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:45,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:45,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857425741] [2025-03-16 15:00:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:45,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:45,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:45,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:45,557 INFO L87 Difference]: Start difference. First operand 23967 states and 27188 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:00:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:48,100 INFO L93 Difference]: Finished difference Result 47146 states and 53578 transitions. [2025-03-16 15:00:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:48,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 254 [2025-03-16 15:00:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:48,125 INFO L225 Difference]: With dead ends: 47146 [2025-03-16 15:00:48,126 INFO L226 Difference]: Without dead ends: 23967 [2025-03-16 15:00:48,142 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:00:48,143 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:48,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1184 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:00:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23967 states. [2025-03-16 15:00:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23967 to 23967. [2025-03-16 15:00:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23967 states, 23966 states have (on average 1.1342318284236002) internal successors, (27183), 23966 states have internal predecessors, (27183), 0 states have call successors, (0), 0 states 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:00:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23967 states to 23967 states and 27183 transitions. [2025-03-16 15:00:48,363 INFO L78 Accepts]: Start accepts. Automaton has 23967 states and 27183 transitions. Word has length 254 [2025-03-16 15:00:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:48,363 INFO L471 AbstractCegarLoop]: Abstraction has 23967 states and 27183 transitions. [2025-03-16 15:00:48,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:00:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 23967 states and 27183 transitions. [2025-03-16 15:00:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 15:00:48,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:48,366 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 15:00:48,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:00:48,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:48,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:48,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2015484232, now seen corresponding path program 1 times [2025-03-16 15:00:48,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:48,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986908063] [2025-03-16 15:00:48,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:48,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 15:00:48,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 15:00:48,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:48,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 15:00:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:48,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986908063] [2025-03-16 15:00:48,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986908063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:48,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:48,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111334276] [2025-03-16 15:00:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:48,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:00:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:48,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:00:48,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:48,606 INFO L87 Difference]: Start difference. First operand 23967 states and 27183 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:00:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:54,392 INFO L93 Difference]: Finished difference Result 85142 states and 97158 transitions. [2025-03-16 15:00:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:00:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 261 [2025-03-16 15:00:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:54,454 INFO L225 Difference]: With dead ends: 85142 [2025-03-16 15:00:54,454 INFO L226 Difference]: Without dead ends: 61963 [2025-03-16 15:00:54,474 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:00:54,475 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 1740 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6753 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 7811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 6753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:54,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 865 Invalid, 7811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 6753 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-03-16 15:00:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61963 states. [2025-03-16 15:00:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61963 to 60258. [2025-03-16 15:00:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60258 states, 60257 states have (on average 1.1227077352008896) internal successors, (67651), 60257 states have internal predecessors, (67651), 0 states have call successors, (0), 0 states 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:00:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60258 states to 60258 states and 67651 transitions. [2025-03-16 15:00:54,965 INFO L78 Accepts]: Start accepts. Automaton has 60258 states and 67651 transitions. Word has length 261 [2025-03-16 15:00:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:54,966 INFO L471 AbstractCegarLoop]: Abstraction has 60258 states and 67651 transitions. [2025-03-16 15:00:54,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:00:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 60258 states and 67651 transitions. [2025-03-16 15:00:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-16 15:00:54,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:54,970 INFO L218 NwaCegarLoop]: trace histogram [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, 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:00:54,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:00:54,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:54,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash 702166816, now seen corresponding path program 1 times [2025-03-16 15:00:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751461603] [2025-03-16 15:00:54,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:54,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-16 15:00:55,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-16 15:00:55,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:55,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 15:00:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:55,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751461603] [2025-03-16 15:00:55,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751461603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:55,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:55,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979596244] [2025-03-16 15:00:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:55,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:55,330 INFO L87 Difference]: Start difference. First operand 60258 states and 67651 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:00:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:58,239 INFO L93 Difference]: Finished difference Result 146518 states and 166337 transitions. [2025-03-16 15:00:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 318 [2025-03-16 15:00:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:58,320 INFO L225 Difference]: With dead ends: 146518 [2025-03-16 15:00:58,321 INFO L226 Difference]: Without dead ends: 83895 [2025-03-16 15:00:58,359 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:00:58,360 INFO L435 NwaCegarLoop]: 1826 mSDtfsCounter, 746 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:58,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1965 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:00:58,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83895 states. [2025-03-16 15:00:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83895 to 80708. [2025-03-16 15:00:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80708 states, 80707 states have (on average 1.1046997162575738) internal successors, (89157), 80707 states have internal predecessors, (89157), 0 states have call successors, (0), 0 states 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:00:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80708 states to 80708 states and 89157 transitions. [2025-03-16 15:00:59,110 INFO L78 Accepts]: Start accepts. Automaton has 80708 states and 89157 transitions. Word has length 318 [2025-03-16 15:00:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:59,110 INFO L471 AbstractCegarLoop]: Abstraction has 80708 states and 89157 transitions. [2025-03-16 15:00:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:00:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 80708 states and 89157 transitions. [2025-03-16 15:00:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-16 15:00:59,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:59,113 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:00:59,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:00:59,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:59,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1107465923, now seen corresponding path program 1 times [2025-03-16 15:00:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703473456] [2025-03-16 15:00:59,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:59,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:59,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 15:00:59,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 15:00:59,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:59,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 208 proven. 113 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 15:01:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:00,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703473456] [2025-03-16 15:01:00,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703473456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:01:00,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634288030] [2025-03-16 15:01:00,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:00,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:01:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:00,125 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:01:00,128 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:01:00,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 15:01:00,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 15:01:00,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:00,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:00,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:01:00,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:01:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-16 15:01:00,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:01:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634288030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:00,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:01:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:01:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133763472] [2025-03-16 15:01:00,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:00,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:00,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:00,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:01:00,388 INFO L87 Difference]: Start difference. First operand 80708 states and 89157 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:01:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:03,427 INFO L93 Difference]: Finished difference Result 160626 states and 177520 transitions. [2025-03-16 15:01:03,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:03,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 347 [2025-03-16 15:01:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:03,520 INFO L225 Difference]: With dead ends: 160626 [2025-03-16 15:01:03,520 INFO L226 Difference]: Without dead ends: 80706 [2025-03-16 15:01:03,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:01:03,571 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:03,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1421 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:01:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80706 states. [2025-03-16 15:01:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80706 to 80705. [2025-03-16 15:01:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80705 states, 80704 states have (on average 1.0795871332275973) internal successors, (87127), 80704 states have internal predecessors, (87127), 0 states have call successors, (0), 0 states 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:01:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80705 states to 80705 states and 87127 transitions. [2025-03-16 15:01:04,388 INFO L78 Accepts]: Start accepts. Automaton has 80705 states and 87127 transitions. Word has length 347 [2025-03-16 15:01:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:04,389 INFO L471 AbstractCegarLoop]: Abstraction has 80705 states and 87127 transitions. [2025-03-16 15:01:04,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:01:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 80705 states and 87127 transitions. [2025-03-16 15:01:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-16 15:01:04,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:04,392 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:04,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:01:04,593 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,SelfDestructingSolverStorable11 [2025-03-16 15:01:04,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash 93167243, now seen corresponding path program 1 times [2025-03-16 15:01:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016849851] [2025-03-16 15:01:04,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:04,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-16 15:01:04,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-16 15:01:04,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:04,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-16 15:01:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016849851] [2025-03-16 15:01:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016849851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:04,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:04,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833433528] [2025-03-16 15:01:04,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:04,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:04,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:04,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:04,763 INFO L87 Difference]: Start difference. First operand 80705 states and 87127 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:01:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:08,196 INFO L93 Difference]: Finished difference Result 187387 states and 204111 transitions. [2025-03-16 15:01:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:08,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 377 [2025-03-16 15:01:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:08,345 INFO L225 Difference]: With dead ends: 187387 [2025-03-16 15:01:08,345 INFO L226 Difference]: Without dead ends: 107470 [2025-03-16 15:01:08,405 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:01:08,405 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 873 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:08,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 904 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:01:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107470 states. [2025-03-16 15:01:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107470 to 105090. [2025-03-16 15:01:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105090 states, 105089 states have (on average 1.085327674637688) internal successors, (114056), 105089 states have internal predecessors, (114056), 0 states have call successors, (0), 0 states 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:01:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105090 states to 105090 states and 114056 transitions. [2025-03-16 15:01:09,746 INFO L78 Accepts]: Start accepts. Automaton has 105090 states and 114056 transitions. Word has length 377 [2025-03-16 15:01:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 105090 states and 114056 transitions. [2025-03-16 15:01:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:01:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 105090 states and 114056 transitions. [2025-03-16 15:01:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-16 15:01:09,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:09,752 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:01:09,752 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -845403459, now seen corresponding path program 1 times [2025-03-16 15:01:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885795539] [2025-03-16 15:01:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:09,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 15:01:09,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 15:01:09,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:09,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:01:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885795539] [2025-03-16 15:01:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885795539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453395970] [2025-03-16 15:01:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:09,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:09,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:09,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:09,930 INFO L87 Difference]: Start difference. First operand 105090 states and 114056 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:01:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:13,141 INFO L93 Difference]: Finished difference Result 236165 states and 257962 transitions. [2025-03-16 15:01:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 415 [2025-03-16 15:01:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:13,299 INFO L225 Difference]: With dead ends: 236165 [2025-03-16 15:01:13,299 INFO L226 Difference]: Without dead ends: 129502 [2025-03-16 15:01:13,349 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:01:13,350 INFO L435 NwaCegarLoop]: 1740 mSDtfsCounter, 785 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:13,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1882 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:01:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129502 states. [2025-03-16 15:01:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129502 to 127912. [2025-03-16 15:01:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127912 states, 127911 states have (on average 1.0750600026580983) internal successors, (137512), 127911 states have internal predecessors, (137512), 0 states have call successors, (0), 0 states 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:01:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127912 states to 127912 states and 137512 transitions. [2025-03-16 15:01:14,897 INFO L78 Accepts]: Start accepts. Automaton has 127912 states and 137512 transitions. Word has length 415 [2025-03-16 15:01:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:14,898 INFO L471 AbstractCegarLoop]: Abstraction has 127912 states and 137512 transitions. [2025-03-16 15:01:14,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:01:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 127912 states and 137512 transitions. [2025-03-16 15:01:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-16 15:01:14,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:14,912 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:01:14,912 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:14,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash -408227050, now seen corresponding path program 1 times [2025-03-16 15:01:14,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:14,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499255196] [2025-03-16 15:01:14,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:14,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-16 15:01:14,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-16 15:01:14,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:14,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-16 15:01:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499255196] [2025-03-16 15:01:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499255196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201950751] [2025-03-16 15:01:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:15,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:15,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:15,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:15,204 INFO L87 Difference]: Start difference. First operand 127912 states and 137512 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:01:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:18,043 INFO L93 Difference]: Finished difference Result 256614 states and 275821 transitions. [2025-03-16 15:01:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:18,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 534 [2025-03-16 15:01:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:18,217 INFO L225 Difference]: With dead ends: 256614 [2025-03-16 15:01:18,217 INFO L226 Difference]: Without dead ends: 129490 [2025-03-16 15:01:18,279 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:01:18,280 INFO L435 NwaCegarLoop]: 1375 mSDtfsCounter, 936 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:18,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1457 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:01:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129490 states. [2025-03-16 15:01:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129490 to 127903. [2025-03-16 15:01:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127903 states, 127902 states have (on average 1.0560585448233804) internal successors, (135072), 127902 states have internal predecessors, (135072), 0 states have call successors, (0), 0 states 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:01:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127903 states to 127903 states and 135072 transitions. [2025-03-16 15:01:19,715 INFO L78 Accepts]: Start accepts. Automaton has 127903 states and 135072 transitions. Word has length 534 [2025-03-16 15:01:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:19,715 INFO L471 AbstractCegarLoop]: Abstraction has 127903 states and 135072 transitions. [2025-03-16 15:01:19,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:01:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 127903 states and 135072 transitions. [2025-03-16 15:01:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-16 15:01:19,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:19,726 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:19,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:01:19,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:19,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash -388092780, now seen corresponding path program 1 times [2025-03-16 15:01:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:19,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234508486] [2025-03-16 15:01:19,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:19,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:19,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-16 15:01:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-16 15:01:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-16 15:01:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234508486] [2025-03-16 15:01:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234508486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:20,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264996363] [2025-03-16 15:01:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:20,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:20,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:20,143 INFO L87 Difference]: Start difference. First operand 127903 states and 135072 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:01:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:22,857 INFO L93 Difference]: Finished difference Result 240065 states and 254008 transitions. [2025-03-16 15:01:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:22,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 545 [2025-03-16 15:01:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:22,993 INFO L225 Difference]: With dead ends: 240065 [2025-03-16 15:01:22,993 INFO L226 Difference]: Without dead ends: 128696 [2025-03-16 15:01:23,043 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:01:23,044 INFO L435 NwaCegarLoop]: 1786 mSDtfsCounter, 722 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:23,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1919 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:01:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128696 states. [2025-03-16 15:01:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128696 to 128691. [2025-03-16 15:01:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128691 states, 128690 states have (on average 1.0560183386432511) internal successors, (135899), 128690 states have internal predecessors, (135899), 0 states have call successors, (0), 0 states 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:01:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128691 states to 128691 states and 135899 transitions. [2025-03-16 15:01:24,451 INFO L78 Accepts]: Start accepts. Automaton has 128691 states and 135899 transitions. Word has length 545 [2025-03-16 15:01:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:24,452 INFO L471 AbstractCegarLoop]: Abstraction has 128691 states and 135899 transitions. [2025-03-16 15:01:24,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:01:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 128691 states and 135899 transitions. [2025-03-16 15:01:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-16 15:01:24,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:24,474 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:24,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:01:24,475 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:24,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash 348543808, now seen corresponding path program 1 times [2025-03-16 15:01:24,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:24,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265368057] [2025-03-16 15:01:24,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:24,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-16 15:01:24,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-16 15:01:24,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:24,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-16 15:01:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265368057] [2025-03-16 15:01:25,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265368057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:25,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972651055] [2025-03-16 15:01:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:25,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:25,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:25,167 INFO L87 Difference]: Start difference. First operand 128691 states and 135899 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:28,066 INFO L93 Difference]: Finished difference Result 250260 states and 264941 transitions. [2025-03-16 15:01:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:28,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 575 [2025-03-16 15:01:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:28,214 INFO L225 Difference]: With dead ends: 250260 [2025-03-16 15:01:28,214 INFO L226 Difference]: Without dead ends: 138103 [2025-03-16 15:01:28,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:01:28,293 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1177 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 742 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:28,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 347 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [742 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:01:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138103 states. [2025-03-16 15:01:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138103 to 138103. [2025-03-16 15:01:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138103 states, 138102 states have (on average 1.052692937104459) internal successors, (145379), 138102 states have internal predecessors, (145379), 0 states have call successors, (0), 0 states 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:01:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138103 states to 138103 states and 145379 transitions. [2025-03-16 15:01:29,870 INFO L78 Accepts]: Start accepts. Automaton has 138103 states and 145379 transitions. Word has length 575 [2025-03-16 15:01:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:29,871 INFO L471 AbstractCegarLoop]: Abstraction has 138103 states and 145379 transitions. [2025-03-16 15:01:29,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 138103 states and 145379 transitions. [2025-03-16 15:01:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-03-16 15:01:29,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:29,888 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:29,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:01:29,888 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:29,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash -153351677, now seen corresponding path program 1 times [2025-03-16 15:01:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:29,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143445069] [2025-03-16 15:01:29,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:29,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:29,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-03-16 15:01:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-03-16 15:01:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-16 15:01:30,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:30,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143445069] [2025-03-16 15:01:30,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143445069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:30,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:30,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:01:30,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950567195] [2025-03-16 15:01:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:30,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:01:30,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:30,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:01:30,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:01:30,484 INFO L87 Difference]: Start difference. First operand 138103 states and 145379 transitions. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:01:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:36,377 INFO L93 Difference]: Finished difference Result 388946 states and 409989 transitions. [2025-03-16 15:01:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:01:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 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 625 [2025-03-16 15:01:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:36,662 INFO L225 Difference]: With dead ends: 388946 [2025-03-16 15:01:36,662 INFO L226 Difference]: Without dead ends: 251631 [2025-03-16 15:01:36,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:01:36,721 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 1710 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 6309 mSolverCounterSat, 1095 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 7404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1095 IncrementalHoareTripleChecker+Valid, 6309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:36,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 876 Invalid, 7404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1095 Valid, 6309 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-16 15:01:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251631 states. [2025-03-16 15:01:39,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251631 to 231802. [2025-03-16 15:01:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231802 states, 231801 states have (on average 1.0489040168075203) internal successors, (243137), 231801 states have internal predecessors, (243137), 0 states have call successors, (0), 0 states 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:01:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231802 states to 231802 states and 243137 transitions. [2025-03-16 15:01:39,437 INFO L78 Accepts]: Start accepts. Automaton has 231802 states and 243137 transitions. Word has length 625 [2025-03-16 15:01:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:39,437 INFO L471 AbstractCegarLoop]: Abstraction has 231802 states and 243137 transitions. [2025-03-16 15:01:39,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:01:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 231802 states and 243137 transitions. [2025-03-16 15:01:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2025-03-16 15:01:39,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:39,501 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:39,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:01:39,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:39,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1983042723, now seen corresponding path program 1 times [2025-03-16 15:01:39,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:39,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124107371] [2025-03-16 15:01:39,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:39,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 857 statements into 1 equivalence classes. [2025-03-16 15:01:39,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 857 of 857 statements. [2025-03-16 15:01:39,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:39,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-16 15:01:40,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:40,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124107371] [2025-03-16 15:01:40,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124107371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:40,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:40,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820608472] [2025-03-16 15:01:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:40,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:01:40,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:40,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:01:40,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:01:40,282 INFO L87 Difference]: Start difference. First operand 231802 states and 243137 transitions. Second operand has 4 states, 4 states have (on average 209.5) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)