./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label46.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 1c2312716e6fa6f39794093b35b73580b35ed138a1f875dde4c4286d98110cb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:38:45,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:38:45,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:38:45,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:38:45,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:38:45,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:38:45,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:38:45,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:38:45,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:38:45,854 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:38:45,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:38:45,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:38:45,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:38:45,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:38:45,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:38:45,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:38:45,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:38:45,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:38:45,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:38:45,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:38:45,858 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 -> 1c2312716e6fa6f39794093b35b73580b35ed138a1f875dde4c4286d98110cb3 [2025-03-03 10:38:46,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:38:46,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:38:46,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:38:46,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:38:46,075 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:38:46,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label46.c [2025-03-03 10:38:47,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b212254/a98924354d6a4764a2448575c1b08a7c/FLAGcfd3fbac5 [2025-03-03 10:38:47,679 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:38:47,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label46.c [2025-03-03 10:38:47,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b212254/a98924354d6a4764a2448575c1b08a7c/FLAGcfd3fbac5 [2025-03-03 10:38:47,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b212254/a98924354d6a4764a2448575c1b08a7c [2025-03-03 10:38:47,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:38:47,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:38:47,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:38:47,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:38:47,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:38:47,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:47" (1/1) ... [2025-03-03 10:38:47,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e42b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:47, skipping insertion in model container [2025-03-03 10:38:47,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:47" (1/1) ... [2025-03-03 10:38:47,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:38:48,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label46.c[7526,7539] [2025-03-03 10:38:48,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:38:48,453 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:38:48,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label46.c[7526,7539] [2025-03-03 10:38:48,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:38:48,724 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:38:48,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48 WrapperNode [2025-03-03 10:38:48,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:38:48,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:38:48,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:38:48,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:38:48,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:48,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:48,992 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:38:48,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:38:48,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:38:48,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:38:48,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:38:48,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,205 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:38:49,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:38:49,462 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:38:49,463 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:38:49,463 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:38:49,464 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (1/1) ... [2025-03-03 10:38:49,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:38:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:49,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:38:49,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:38:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:38:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:38:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:38:49,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:38:49,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:38:49,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:38:52,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:38:52,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:38:52,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:38:53,010 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:38:53,010 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:38:53,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:38:53,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:38:53,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:53 BoogieIcfgContainer [2025-03-03 10:38:53,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:38:53,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:38:53,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:38:53,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:38:53,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:38:47" (1/3) ... [2025-03-03 10:38:53,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1129b922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:53, skipping insertion in model container [2025-03-03 10:38:53,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:48" (2/3) ... [2025-03-03 10:38:53,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1129b922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:53, skipping insertion in model container [2025-03-03 10:38:53,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:53" (3/3) ... [2025-03-03 10:38:53,047 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label46.c [2025-03-03 10:38:53,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:38:53,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label46.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:38:53,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:38:53,135 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;@29632e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:38:53,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:38:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 10:38:53,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:53,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:53,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:53,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:53,155 INFO L85 PathProgramCache]: Analyzing trace with hash 394579166, now seen corresponding path program 1 times [2025-03-03 10:38:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681963722] [2025-03-03 10:38:53,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:53,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 10:38:53,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 10:38:53,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:53,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:53,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681963722] [2025-03-03 10:38:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681963722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:53,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:53,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:38:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977250834] [2025-03-03 10:38:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:53,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:53,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:53,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:53,462 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:56,290 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:38:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:56,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 10:38:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:56,309 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:38:56,309 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:38:56,316 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-03 10:38:56,319 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 798 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:56,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:38:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:38:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:38:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.869767441860465) internal successors, (2814), 1505 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions. [2025-03-03 10:38:56,425 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 61 [2025-03-03 10:38:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:56,426 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions. [2025-03-03 10:38:56,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions. [2025-03-03 10:38:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 10:38:56,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:56,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:38:56,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:38:56,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:56,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash 424137216, now seen corresponding path program 1 times [2025-03-03 10:38:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898532359] [2025-03-03 10:38:56,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:56,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 10:38:56,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 10:38:56,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:56,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898532359] [2025-03-03 10:38:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898532359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:56,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:56,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507096398] [2025-03-03 10:38:56,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:56,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:38:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:56,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:38:56,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:38:56,736 INFO L87 Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:00,581 INFO L93 Difference]: Finished difference Result 5271 states and 9820 transitions. [2025-03-03 10:39:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:39:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-03 10:39:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:00,594 INFO L225 Difference]: With dead ends: 5271 [2025-03-03 10:39:00,595 INFO L226 Difference]: Without dead ends: 3767 [2025-03-03 10:39:00,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:39:00,599 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 2296 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:00,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 199 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 10:39:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-03-03 10:39:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759. [2025-03-03 10:39:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.6120276742948376) internal successors, (6058), 3758 states have internal predecessors, (6058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6058 transitions. [2025-03-03 10:39:00,653 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 6058 transitions. Word has length 134 [2025-03-03 10:39:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:00,655 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 6058 transitions. [2025-03-03 10:39:00,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 6058 transitions. [2025-03-03 10:39:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 10:39:00,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:00,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:39:00,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:39:00,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash 826811498, now seen corresponding path program 1 times [2025-03-03 10:39:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341203130] [2025-03-03 10:39:00,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:00,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 10:39:00,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 10:39:00,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:00,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 10:39:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341203130] [2025-03-03 10:39:01,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341203130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152537423] [2025-03-03 10:39:01,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:01,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:01,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:01,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:01,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:39:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 10:39:01,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 10:39:01,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:01,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:01,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:01,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 10:39:01,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152537423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:39:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219037019] [2025-03-03 10:39:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:01,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:01,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:01,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:39:01,451 INFO L87 Difference]: Start difference. First operand 3759 states and 6058 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:03,464 INFO L93 Difference]: Finished difference Result 9769 states and 15358 transitions. [2025-03-03 10:39:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:03,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 202 [2025-03-03 10:39:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:03,482 INFO L225 Difference]: With dead ends: 9769 [2025-03-03 10:39:03,482 INFO L226 Difference]: Without dead ends: 6012 [2025-03-03 10:39:03,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:39:03,487 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 619 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:03,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 673 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:39:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-03 10:39:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5261. [2025-03-03 10:39:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.5376425855513307) internal successors, (8088), 5260 states have internal predecessors, (8088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 8088 transitions. [2025-03-03 10:39:03,564 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 8088 transitions. Word has length 202 [2025-03-03 10:39:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:03,565 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 8088 transitions. [2025-03-03 10:39:03,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 8088 transitions. [2025-03-03 10:39:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 10:39:03,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:03,568 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:03,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:39:03,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:03,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:03,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:03,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1819691656, now seen corresponding path program 1 times [2025-03-03 10:39:03,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:03,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504154822] [2025-03-03 10:39:03,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:03,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 10:39:03,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 10:39:03,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:03,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 10:39:04,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:04,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504154822] [2025-03-03 10:39:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504154822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:04,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:04,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:04,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736831420] [2025-03-03 10:39:04,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:04,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:39:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:04,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:39:04,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:39:04,058 INFO L87 Difference]: Start difference. First operand 5261 states and 8088 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:06,920 INFO L93 Difference]: Finished difference Result 15063 states and 23539 transitions. [2025-03-03 10:39:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:39:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 207 [2025-03-03 10:39:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:06,942 INFO L225 Difference]: With dead ends: 15063 [2025-03-03 10:39:06,942 INFO L226 Difference]: Without dead ends: 9767 [2025-03-03 10:39:06,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:39:06,950 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:06,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:39:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-03-03 10:39:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-03-03 10:39:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3098505017407331) internal successors, (12792), 9766 states have internal predecessors, (12792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12792 transitions. [2025-03-03 10:39:07,147 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12792 transitions. Word has length 207 [2025-03-03 10:39:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:07,148 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12792 transitions. [2025-03-03 10:39:07,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12792 transitions. [2025-03-03 10:39:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-03 10:39:07,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:07,151 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:07,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:39:07,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:07,152 INFO L85 PathProgramCache]: Analyzing trace with hash -547343399, now seen corresponding path program 1 times [2025-03-03 10:39:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:07,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057726867] [2025-03-03 10:39:07,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:07,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-03 10:39:07,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-03 10:39:07,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:07,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 10:39:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057726867] [2025-03-03 10:39:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057726867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:07,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:07,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:39:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82305727] [2025-03-03 10:39:07,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:07,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:07,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:07,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:07,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:07,310 INFO L87 Difference]: Start difference. First operand 9767 states and 12792 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:09,423 INFO L93 Difference]: Finished difference Result 24040 states and 32728 transitions. [2025-03-03 10:39:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:09,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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 277 [2025-03-03 10:39:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:09,450 INFO L225 Difference]: With dead ends: 24040 [2025-03-03 10:39:09,450 INFO L226 Difference]: Without dead ends: 14275 [2025-03-03 10:39:09,457 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-03 10:39:09,458 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:09,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 376 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:39:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2025-03-03 10:39:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 14273. [2025-03-03 10:39:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.3160033632286996) internal successors, (18782), 14272 states have internal predecessors, (18782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18782 transitions. [2025-03-03 10:39:09,652 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 18782 transitions. Word has length 277 [2025-03-03 10:39:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 18782 transitions. [2025-03-03 10:39:09,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 18782 transitions. [2025-03-03 10:39:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-03 10:39:09,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:09,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:09,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:39:09,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:09,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1385535648, now seen corresponding path program 1 times [2025-03-03 10:39:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:09,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910039597] [2025-03-03 10:39:09,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:09,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-03 10:39:09,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-03 10:39:09,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:09,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:39:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910039597] [2025-03-03 10:39:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910039597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595529888] [2025-03-03 10:39:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:09,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:09,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:09,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:09,949 INFO L87 Difference]: Start difference. First operand 14273 states and 18782 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:12,215 INFO L93 Difference]: Finished difference Result 28544 states and 37562 transitions. [2025-03-03 10:39:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 288 [2025-03-03 10:39:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:12,240 INFO L225 Difference]: With dead ends: 28544 [2025-03-03 10:39:12,240 INFO L226 Difference]: Without dead ends: 14273 [2025-03-03 10:39:12,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:12,252 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 682 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:12,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1273 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:39:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2025-03-03 10:39:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 14273. [2025-03-03 10:39:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.2623318385650224) internal successors, (18016), 14272 states have internal predecessors, (18016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18016 transitions. [2025-03-03 10:39:12,437 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 18016 transitions. Word has length 288 [2025-03-03 10:39:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:12,438 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 18016 transitions. [2025-03-03 10:39:12,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 18016 transitions. [2025-03-03 10:39:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-03 10:39:12,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:12,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:12,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:39:12,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:12,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash -722122326, now seen corresponding path program 1 times [2025-03-03 10:39:12,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:12,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279180073] [2025-03-03 10:39:12,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:12,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-03 10:39:12,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-03 10:39:12,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:12,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 10:39:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279180073] [2025-03-03 10:39:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279180073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:12,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089432418] [2025-03-03 10:39:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:12,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:12,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:12,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:12,588 INFO L87 Difference]: Start difference. First operand 14273 states and 18016 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:14,991 INFO L93 Difference]: Finished difference Result 37556 states and 48447 transitions. [2025-03-03 10:39:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:14,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 292 [2025-03-03 10:39:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:15,028 INFO L225 Difference]: With dead ends: 37556 [2025-03-03 10:39:15,029 INFO L226 Difference]: Without dead ends: 23285 [2025-03-03 10:39:15,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:15,042 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 739 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:15,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 376 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:39:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2025-03-03 10:39:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 23285. [2025-03-03 10:39:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.2509019068888507) internal successors, (29126), 23284 states have internal predecessors, (29126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 29126 transitions. [2025-03-03 10:39:15,260 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 29126 transitions. Word has length 292 [2025-03-03 10:39:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:15,261 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 29126 transitions. [2025-03-03 10:39:15,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 29126 transitions. [2025-03-03 10:39:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-03 10:39:15,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:15,266 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:39:15,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:15,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1774924264, now seen corresponding path program 1 times [2025-03-03 10:39:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927595224] [2025-03-03 10:39:15,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:15,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-03 10:39:15,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-03 10:39:15,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:15,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:39:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927595224] [2025-03-03 10:39:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927595224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023985496] [2025-03-03 10:39:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:15,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:15,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:15,449 INFO L87 Difference]: Start difference. First operand 23285 states and 29126 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:17,761 INFO L93 Difference]: Finished difference Result 66094 states and 83272 transitions. [2025-03-03 10:39:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:17,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 323 [2025-03-03 10:39:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:17,838 INFO L225 Difference]: With dead ends: 66094 [2025-03-03 10:39:17,842 INFO L226 Difference]: Without dead ends: 42811 [2025-03-03 10:39:17,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:17,866 INFO L435 NwaCegarLoop]: 1403 mSDtfsCounter, 693 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:17,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1411 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:39:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42811 states. [2025-03-03 10:39:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42811 to 42811. [2025-03-03 10:39:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42811 states, 42810 states have (on average 1.1685353889278205) internal successors, (50025), 42810 states have internal predecessors, (50025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42811 states to 42811 states and 50025 transitions. [2025-03-03 10:39:18,486 INFO L78 Accepts]: Start accepts. Automaton has 42811 states and 50025 transitions. Word has length 323 [2025-03-03 10:39:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:18,486 INFO L471 AbstractCegarLoop]: Abstraction has 42811 states and 50025 transitions. [2025-03-03 10:39:18,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42811 states and 50025 transitions. [2025-03-03 10:39:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-03 10:39:18,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:18,494 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:18,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:39:18,494 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:18,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash -261879314, now seen corresponding path program 1 times [2025-03-03 10:39:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:18,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480669304] [2025-03-03 10:39:18,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:18,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-03 10:39:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-03 10:39:18,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 10:39:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480669304] [2025-03-03 10:39:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480669304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:18,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:39:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113920193] [2025-03-03 10:39:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:18,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:18,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:18,704 INFO L87 Difference]: Start difference. First operand 42811 states and 50025 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:21,033 INFO L93 Difference]: Finished difference Result 105146 states and 125173 transitions. [2025-03-03 10:39:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 383 [2025-03-03 10:39:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:21,107 INFO L225 Difference]: With dead ends: 105146 [2025-03-03 10:39:21,107 INFO L226 Difference]: Without dead ends: 62337 [2025-03-03 10:39:21,137 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-03 10:39:21,138 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 660 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:21,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 428 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:39:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62337 states. [2025-03-03 10:39:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62337 to 55578. [2025-03-03 10:39:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55578 states, 55577 states have (on average 1.1561077424114292) internal successors, (64253), 55577 states have internal predecessors, (64253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55578 states to 55578 states and 64253 transitions. [2025-03-03 10:39:21,936 INFO L78 Accepts]: Start accepts. Automaton has 55578 states and 64253 transitions. Word has length 383 [2025-03-03 10:39:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:21,940 INFO L471 AbstractCegarLoop]: Abstraction has 55578 states and 64253 transitions. [2025-03-03 10:39:21,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 55578 states and 64253 transitions. [2025-03-03 10:39:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-03 10:39:21,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:21,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:21,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:39:21,949 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:21,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1240909803, now seen corresponding path program 1 times [2025-03-03 10:39:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:21,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353280831] [2025-03-03 10:39:21,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:21,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-03 10:39:21,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-03 10:39:21,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:21,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:39:22,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:22,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353280831] [2025-03-03 10:39:22,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353280831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:22,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:22,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:22,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265325864] [2025-03-03 10:39:22,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:22,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:22,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:22,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:22,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:22,179 INFO L87 Difference]: Start difference. First operand 55578 states and 64253 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:24,372 INFO L93 Difference]: Finished difference Result 132182 states and 155239 transitions. [2025-03-03 10:39:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:24,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 446 [2025-03-03 10:39:24,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:24,451 INFO L225 Difference]: With dead ends: 132182 [2025-03-03 10:39:24,452 INFO L226 Difference]: Without dead ends: 76606 [2025-03-03 10:39:24,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:24,485 INFO L435 NwaCegarLoop]: 1220 mSDtfsCounter, 714 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:24,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1228 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:39:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76606 states. [2025-03-03 10:39:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76606 to 76606. [2025-03-03 10:39:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76606 states, 76605 states have (on average 1.1337902225703282) internal successors, (86854), 76605 states have internal predecessors, (86854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76606 states to 76606 states and 86854 transitions. [2025-03-03 10:39:25,316 INFO L78 Accepts]: Start accepts. Automaton has 76606 states and 86854 transitions. Word has length 446 [2025-03-03 10:39:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:25,318 INFO L471 AbstractCegarLoop]: Abstraction has 76606 states and 86854 transitions. [2025-03-03 10:39:25,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76606 states and 86854 transitions. [2025-03-03 10:39:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 10:39:25,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:25,327 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:39:25,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -154405042, now seen corresponding path program 1 times [2025-03-03 10:39:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341595699] [2025-03-03 10:39:25,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:25,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 10:39:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 10:39:25,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:25,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 276 proven. 333 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 10:39:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341595699] [2025-03-03 10:39:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341595699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486117090] [2025-03-03 10:39:25,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:25,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:25,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:39:25,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 10:39:25,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 10:39:25,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:25,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:25,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:25,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-03 10:39:25,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486117090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:25,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:39:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802605585] [2025-03-03 10:39:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:25,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:25,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:25,946 INFO L87 Difference]: Start difference. First operand 76606 states and 86854 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:28,178 INFO L93 Difference]: Finished difference Result 168230 states and 190565 transitions. [2025-03-03 10:39:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:28,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 499 [2025-03-03 10:39:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:28,290 INFO L225 Difference]: With dead ends: 168230 [2025-03-03 10:39:28,291 INFO L226 Difference]: Without dead ends: 91626 [2025-03-03 10:39:28,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:28,341 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 813 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:28,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1117 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:39:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91626 states. [2025-03-03 10:39:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91626 to 91626. [2025-03-03 10:39:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91626 states, 91625 states have (on average 1.1207094133697135) internal successors, (102685), 91625 states have internal predecessors, (102685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91626 states to 91626 states and 102685 transitions. [2025-03-03 10:39:29,449 INFO L78 Accepts]: Start accepts. Automaton has 91626 states and 102685 transitions. Word has length 499 [2025-03-03 10:39:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:29,449 INFO L471 AbstractCegarLoop]: Abstraction has 91626 states and 102685 transitions. [2025-03-03 10:39:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 91626 states and 102685 transitions. [2025-03-03 10:39:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 10:39:29,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:29,459 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:29,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:39:29,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 10:39:29,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash -415970863, now seen corresponding path program 1 times [2025-03-03 10:39:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827143673] [2025-03-03 10:39:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:29,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 10:39:29,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 10:39:29,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:29,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-03 10:39:29,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:29,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827143673] [2025-03-03 10:39:29,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827143673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:29,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:29,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:29,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241094375] [2025-03-03 10:39:29,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:29,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:29,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:29,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:29,943 INFO L87 Difference]: Start difference. First operand 91626 states and 102685 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:32,112 INFO L93 Difference]: Finished difference Result 187756 states and 209996 transitions. [2025-03-03 10:39:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:32,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 540 [2025-03-03 10:39:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:32,212 INFO L225 Difference]: With dead ends: 187756 [2025-03-03 10:39:32,212 INFO L226 Difference]: Without dead ends: 91626 [2025-03-03 10:39:32,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:32,262 INFO L435 NwaCegarLoop]: 1223 mSDtfsCounter, 668 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:32,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1231 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:39:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91626 states. [2025-03-03 10:39:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91626 to 87871. [2025-03-03 10:39:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87871 states, 87870 states have (on average 1.0871059519745079) internal successors, (95524), 87870 states have internal predecessors, (95524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87871 states to 87871 states and 95524 transitions. [2025-03-03 10:39:33,282 INFO L78 Accepts]: Start accepts. Automaton has 87871 states and 95524 transitions. Word has length 540 [2025-03-03 10:39:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:33,282 INFO L471 AbstractCegarLoop]: Abstraction has 87871 states and 95524 transitions. [2025-03-03 10:39:33,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 87871 states and 95524 transitions. [2025-03-03 10:39:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-03 10:39:33,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:33,297 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:39:33,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1626876779, now seen corresponding path program 1 times [2025-03-03 10:39:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405575745] [2025-03-03 10:39:33,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:33,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-03 10:39:33,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-03 10:39:33,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 652 proven. 229 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 10:39:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405575745] [2025-03-03 10:39:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405575745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361553162] [2025-03-03 10:39:34,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:34,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:34,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:34,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:34,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:39:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-03 10:39:34,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-03 10:39:34,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:34,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:34,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:34,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2025-03-03 10:39:34,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361553162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:34,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:39:34,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474211712] [2025-03-03 10:39:34,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:34,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:34,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:39:34,420 INFO L87 Difference]: Start difference. First operand 87871 states and 95524 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) 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-03 10:39:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:36,914 INFO L93 Difference]: Finished difference Result 206531 states and 225833 transitions. [2025-03-03 10:39:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:36,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) 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 631 [2025-03-03 10:39:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:37,037 INFO L225 Difference]: With dead ends: 206531 [2025-03-03 10:39:37,037 INFO L226 Difference]: Without dead ends: 119413 [2025-03-03 10:39:37,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:39:37,089 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:37,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 388 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:39:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119413 states. [2025-03-03 10:39:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119413 to 117160. [2025-03-03 10:39:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117160 states, 117159 states have (on average 1.0933005573622172) internal successors, (128090), 117159 states have internal predecessors, (128090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117160 states to 117160 states and 128090 transitions. [2025-03-03 10:39:38,548 INFO L78 Accepts]: Start accepts. Automaton has 117160 states and 128090 transitions. Word has length 631 [2025-03-03 10:39:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:38,548 INFO L471 AbstractCegarLoop]: Abstraction has 117160 states and 128090 transitions. [2025-03-03 10:39:38,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) 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-03 10:39:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 117160 states and 128090 transitions. [2025-03-03 10:39:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 10:39:38,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:38,568 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:38,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:39:38,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:38,769 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2050745631, now seen corresponding path program 1 times [2025-03-03 10:39:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844662572] [2025-03-03 10:39:38,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:38,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:38,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 10:39:38,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 10:39:38,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:38,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-03 10:39:39,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:39,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844662572] [2025-03-03 10:39:39,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844662572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:39,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:39,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798174892] [2025-03-03 10:39:39,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:39,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:39,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:39,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:39,058 INFO L87 Difference]: Start difference. First operand 117160 states and 128090 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:41,505 INFO L93 Difference]: Finished difference Result 247085 states and 270147 transitions. [2025-03-03 10:39:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 685 [2025-03-03 10:39:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:41,673 INFO L225 Difference]: With dead ends: 247085 [2025-03-03 10:39:41,673 INFO L226 Difference]: Without dead ends: 130678 [2025-03-03 10:39:41,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:41,738 INFO L435 NwaCegarLoop]: 1236 mSDtfsCounter, 674 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:41,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1243 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:39:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130678 states. [2025-03-03 10:39:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130678 to 127674. [2025-03-03 10:39:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127674 states, 127673 states have (on average 1.0755837177790135) internal successors, (137323), 127673 states have internal predecessors, (137323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127674 states to 127674 states and 137323 transitions. [2025-03-03 10:39:43,180 INFO L78 Accepts]: Start accepts. Automaton has 127674 states and 137323 transitions. Word has length 685 [2025-03-03 10:39:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:43,181 INFO L471 AbstractCegarLoop]: Abstraction has 127674 states and 137323 transitions. [2025-03-03 10:39:43,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 127674 states and 137323 transitions. [2025-03-03 10:39:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-03-03 10:39:43,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:43,204 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:39:43,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:39:43,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:43,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:43,205 INFO L85 PathProgramCache]: Analyzing trace with hash -59435577, now seen corresponding path program 1 times [2025-03-03 10:39:43,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:43,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423409381] [2025-03-03 10:39:43,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:43,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:43,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-03-03 10:39:43,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-03-03 10:39:43,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:43,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 771 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-03-03 10:39:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423409381] [2025-03-03 10:39:43,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423409381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:43,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:43,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964712813] [2025-03-03 10:39:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:43,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:43,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:43,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:43,535 INFO L87 Difference]: Start difference. First operand 127674 states and 137323 transitions. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:45,972 INFO L93 Difference]: Finished difference Result 259101 states and 278516 transitions. [2025-03-03 10:39:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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 714 [2025-03-03 10:39:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:46,107 INFO L225 Difference]: With dead ends: 259101 [2025-03-03 10:39:46,108 INFO L226 Difference]: Without dead ends: 132180 [2025-03-03 10:39:46,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:46,164 INFO L435 NwaCegarLoop]: 1184 mSDtfsCounter, 742 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:46,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1191 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:39:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132180 states. [2025-03-03 10:39:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132180 to 126923. [2025-03-03 10:39:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126923 states, 126922 states have (on average 1.0592883818408156) internal successors, (134447), 126922 states have internal predecessors, (134447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126923 states to 126923 states and 134447 transitions. [2025-03-03 10:39:47,560 INFO L78 Accepts]: Start accepts. Automaton has 126923 states and 134447 transitions. Word has length 714 [2025-03-03 10:39:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:47,560 INFO L471 AbstractCegarLoop]: Abstraction has 126923 states and 134447 transitions. [2025-03-03 10:39:47,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 126923 states and 134447 transitions. [2025-03-03 10:39:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2025-03-03 10:39:47,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:47,580 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:39:47,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:39:47,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2000684182, now seen corresponding path program 1 times [2025-03-03 10:39:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319882332] [2025-03-03 10:39:47,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:47,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 720 statements into 1 equivalence classes. [2025-03-03 10:39:47,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 720 of 720 statements. [2025-03-03 10:39:47,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:47,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 789 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-03-03 10:39:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319882332] [2025-03-03 10:39:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319882332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118556928] [2025-03-03 10:39:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:47,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:47,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:47,921 INFO L87 Difference]: Start difference. First operand 126923 states and 134447 transitions. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:50,652 INFO L93 Difference]: Finished difference Result 297402 states and 315429 transitions. [2025-03-03 10:39:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:50,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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 720 [2025-03-03 10:39:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:50,837 INFO L225 Difference]: With dead ends: 297402 [2025-03-03 10:39:50,837 INFO L226 Difference]: Without dead ends: 171232 [2025-03-03 10:39:50,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:50,875 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 678 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:50,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 234 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:39:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171232 states. [2025-03-03 10:39:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171232 to 144947. [2025-03-03 10:39:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144947 states, 144946 states have (on average 1.061698839567839) internal successors, (153889), 144946 states have internal predecessors, (153889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144947 states to 144947 states and 153889 transitions. [2025-03-03 10:39:52,519 INFO L78 Accepts]: Start accepts. Automaton has 144947 states and 153889 transitions. Word has length 720 [2025-03-03 10:39:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:52,519 INFO L471 AbstractCegarLoop]: Abstraction has 144947 states and 153889 transitions. [2025-03-03 10:39:52,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 144947 states and 153889 transitions. [2025-03-03 10:39:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-03-03 10:39:52,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:52,540 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:52,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:39:52,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:52,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 345619661, now seen corresponding path program 1 times [2025-03-03 10:39:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703258555] [2025-03-03 10:39:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:52,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-03-03 10:39:52,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-03-03 10:39:52,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:52,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 10:39:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703258555] [2025-03-03 10:39:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703258555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:53,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769512114] [2025-03-03 10:39:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:53,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:53,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:53,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:53,388 INFO L87 Difference]: Start difference. First operand 144947 states and 153889 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:55,648 INFO L93 Difference]: Finished difference Result 306412 states and 325170 transitions. [2025-03-03 10:39:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 729 [2025-03-03 10:39:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:55,650 INFO L225 Difference]: With dead ends: 306412 [2025-03-03 10:39:55,650 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:39:55,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:55,745 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:55,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 927 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:39:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:39:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:39:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:39:55,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 729 [2025-03-03 10:39:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:55,746 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:39:55,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:39:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:39:55,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:39:55,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:39:55,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:39:55,751 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:55,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.