./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem17_label03.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 89d9992650be4fcd4025f7007fb14b6b521ee1b4b929549cdf6651f6eed1ab75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:07:26,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:07:26,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:07:26,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:07:26,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:07:26,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:07:26,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:07:26,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:07:26,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:07:26,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:07:26,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:07:26,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:07:26,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:07:26,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:07:26,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:07:26,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:07:26,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:07:26,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:07:26,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:07:26,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:07:26,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:07:26,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:07:26,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:07:26,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:07:26,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:07:26,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:07:26,779 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 -> 89d9992650be4fcd4025f7007fb14b6b521ee1b4b929549cdf6651f6eed1ab75 [2025-03-08 02:07:27,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:07:27,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:07:27,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:07:27,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:07:27,035 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:07:27,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label03.c [2025-03-08 02:07:28,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d30a9d9/0c17a5851d4847cf87b11369acf89936/FLAGca907a4c7 [2025-03-08 02:07:28,540 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:07:28,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label03.c [2025-03-08 02:07:28,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d30a9d9/0c17a5851d4847cf87b11369acf89936/FLAGca907a4c7 [2025-03-08 02:07:28,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d30a9d9/0c17a5851d4847cf87b11369acf89936 [2025-03-08 02:07:28,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:07:28,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:07:28,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:07:28,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:07:28,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:07:28,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373fecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28, skipping insertion in model container [2025-03-08 02:07:28,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:07:28,983 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/Problem17_label03.c[7281,7294] [2025-03-08 02:07:29,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:07:29,279 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:07:29,296 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/Problem17_label03.c[7281,7294] [2025-03-08 02:07:29,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:07:29,487 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:07:29,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29 WrapperNode [2025-03-08 02:07:29,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:07:29,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:07:29,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:07:29,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:07:29,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:29,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:29,730 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:07:29,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:07:29,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:07:29,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:07:29,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:07:29,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:29,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:29,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:29,959 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-08 02:07:29,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:29,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:30,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:30,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:30,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:30,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:30,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:07:30,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:07:30,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:07:30,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:07:30,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (1/1) ... [2025-03-08 02:07:30,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:07:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:30,181 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-08 02:07:30,194 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-08 02:07:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:07:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:07:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:07:30,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:07:30,257 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:07:30,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:07:32,806 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:07:32,939 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:07:32,939 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:07:32,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:07:32,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:07:32,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:32 BoogieIcfgContainer [2025-03-08 02:07:32,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:07:32,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:07:32,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:07:32,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:07:32,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:07:28" (1/3) ... [2025-03-08 02:07:32,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5716654c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:32, skipping insertion in model container [2025-03-08 02:07:32,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:29" (2/3) ... [2025-03-08 02:07:32,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5716654c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:32, skipping insertion in model container [2025-03-08 02:07:32,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:32" (3/3) ... [2025-03-08 02:07:32,986 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label03.c [2025-03-08 02:07:33,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:07:33,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label03.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:07:33,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:07:33,142 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;@2e6156a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:07:33,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:07:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 02:07:33,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:33,163 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] [2025-03-08 02:07:33,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:33,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2145351085, now seen corresponding path program 1 times [2025-03-08 02:07:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942073732] [2025-03-08 02:07:33,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:33,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 02:07:33,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 02:07:33,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:33,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:33,448 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-08 02:07:33,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942073732] [2025-03-08 02:07:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942073732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:33,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:33,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622778333] [2025-03-08 02:07:33,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:33,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:33,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:33,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:33,472 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:35,499 INFO L93 Difference]: Finished difference Result 1680 states and 3071 transitions. [2025-03-08 02:07:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:35,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-08 02:07:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:35,516 INFO L225 Difference]: With dead ends: 1680 [2025-03-08 02:07:35,517 INFO L226 Difference]: Without dead ends: 1011 [2025-03-08 02:07:35,521 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-08 02:07:35,524 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 532 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:35,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 220 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:07:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-08 02:07:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 996. [2025-03-08 02:07:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.735678391959799) internal successors, (1727), 995 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1727 transitions. [2025-03-08 02:07:35,584 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1727 transitions. Word has length 49 [2025-03-08 02:07:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:35,585 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1727 transitions. [2025-03-08 02:07:35,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1727 transitions. [2025-03-08 02:07:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 02:07:35,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:35,587 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, 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-08 02:07:35,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:07:35,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:35,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash 98941543, now seen corresponding path program 1 times [2025-03-08 02:07:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:35,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34787864] [2025-03-08 02:07:35,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:35,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:35,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 02:07:35,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 02:07:35,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:35,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34787864] [2025-03-08 02:07:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34787864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:35,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885921936] [2025-03-08 02:07:35,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:35,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:35,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:35,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:35,836 INFO L87 Difference]: Start difference. First operand 996 states and 1727 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:37,509 INFO L93 Difference]: Finished difference Result 2848 states and 4983 transitions. [2025-03-08 02:07:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:37,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-08 02:07:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:37,517 INFO L225 Difference]: With dead ends: 2848 [2025-03-08 02:07:37,517 INFO L226 Difference]: Without dead ends: 1854 [2025-03-08 02:07:37,520 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-08 02:07:37,521 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 394 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:37,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:07:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2025-03-08 02:07:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854. [2025-03-08 02:07:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.4020507285483002) internal successors, (2598), 1853 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2598 transitions. [2025-03-08 02:07:37,574 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2598 transitions. Word has length 114 [2025-03-08 02:07:37,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:37,576 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2598 transitions. [2025-03-08 02:07:37,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2598 transitions. [2025-03-08 02:07:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 02:07:37,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:37,580 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, 1, 1, 1, 1, 1, 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-08 02:07:37,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:07:37,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:37,582 INFO L85 PathProgramCache]: Analyzing trace with hash 716884580, now seen corresponding path program 1 times [2025-03-08 02:07:37,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:37,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650792546] [2025-03-08 02:07:37,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:37,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:37,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 02:07:37,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 02:07:37,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:37,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650792546] [2025-03-08 02:07:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650792546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:37,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367458801] [2025-03-08 02:07:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:37,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:37,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:37,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:37,785 INFO L87 Difference]: Start difference. First operand 1854 states and 2598 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:39,476 INFO L93 Difference]: Finished difference Result 5418 states and 7597 transitions. [2025-03-08 02:07:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 02:07:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:39,486 INFO L225 Difference]: With dead ends: 5418 [2025-03-08 02:07:39,487 INFO L226 Difference]: Without dead ends: 2713 [2025-03-08 02:07:39,493 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-08 02:07:39,494 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 458 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:39,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 874 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:07:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-03-08 02:07:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2710. [2025-03-08 02:07:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.2694721299372462) internal successors, (3439), 2709 states have internal predecessors, (3439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3439 transitions. [2025-03-08 02:07:39,534 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3439 transitions. Word has length 119 [2025-03-08 02:07:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:39,535 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3439 transitions. [2025-03-08 02:07:39,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3439 transitions. [2025-03-08 02:07:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 02:07:39,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:39,537 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, 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-08 02:07:39,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:07:39,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:39,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -269785400, now seen corresponding path program 1 times [2025-03-08 02:07:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167977038] [2025-03-08 02:07:39,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:39,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 02:07:39,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 02:07:39,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:39,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:39,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:39,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167977038] [2025-03-08 02:07:39,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167977038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:39,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:39,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185564426] [2025-03-08 02:07:39,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:39,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:39,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:39,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:39,753 INFO L87 Difference]: Start difference. First operand 2710 states and 3439 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:40,897 INFO L93 Difference]: Finished difference Result 7123 states and 9245 transitions. [2025-03-08 02:07:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:40,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-03-08 02:07:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:40,910 INFO L225 Difference]: With dead ends: 7123 [2025-03-08 02:07:40,910 INFO L226 Difference]: Without dead ends: 4415 [2025-03-08 02:07:40,913 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-08 02:07:40,916 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:40,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 786 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:07:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2025-03-08 02:07:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4415. [2025-03-08 02:07:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4415 states, 4414 states have (on average 1.2417308563661078) internal successors, (5481), 4414 states have internal predecessors, (5481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 5481 transitions. [2025-03-08 02:07:41,006 INFO L78 Accepts]: Start accepts. Automaton has 4415 states and 5481 transitions. Word has length 201 [2025-03-08 02:07:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:41,006 INFO L471 AbstractCegarLoop]: Abstraction has 4415 states and 5481 transitions. [2025-03-08 02:07:41,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 4415 states and 5481 transitions. [2025-03-08 02:07:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 02:07:41,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:41,017 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:41,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:07:41,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:41,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -320230890, now seen corresponding path program 1 times [2025-03-08 02:07:41,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:41,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852226516] [2025-03-08 02:07:41,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:41,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 02:07:41,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 02:07:41,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:41,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 226 proven. 78 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 02:07:41,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:41,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852226516] [2025-03-08 02:07:41,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852226516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:41,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276248981] [2025-03-08 02:07:41,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:41,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:41,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:41,548 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-08 02:07:41,550 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-08 02:07:41,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 02:07:41,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 02:07:41,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:41,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:41,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:07:41,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 226 proven. 78 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 02:07:41,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 02:07:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276248981] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:07:42,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:07:42,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081248750] [2025-03-08 02:07:42,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:42,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:42,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:42,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:07:42,111 INFO L87 Difference]: Start difference. First operand 4415 states and 5481 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:44,546 INFO L93 Difference]: Finished difference Result 16522 states and 20523 transitions. [2025-03-08 02:07:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:44,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 278 [2025-03-08 02:07:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:44,573 INFO L225 Difference]: With dead ends: 16522 [2025-03-08 02:07:44,573 INFO L226 Difference]: Without dead ends: 11683 [2025-03-08 02:07:44,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:07:44,580 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 870 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:44,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 201 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [710 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:07:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11683 states. [2025-03-08 02:07:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11683 to 11679. [2025-03-08 02:07:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11679 states, 11678 states have (on average 1.1909573557115944) internal successors, (13908), 11678 states have internal predecessors, (13908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11679 states to 11679 states and 13908 transitions. [2025-03-08 02:07:44,826 INFO L78 Accepts]: Start accepts. Automaton has 11679 states and 13908 transitions. Word has length 278 [2025-03-08 02:07:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:44,830 INFO L471 AbstractCegarLoop]: Abstraction has 11679 states and 13908 transitions. [2025-03-08 02:07:44,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 11679 states and 13908 transitions. [2025-03-08 02:07:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-08 02:07:44,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:44,834 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:44,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:07:45,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:45,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:45,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:45,036 INFO L85 PathProgramCache]: Analyzing trace with hash -69479413, now seen corresponding path program 1 times [2025-03-08 02:07:45,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:45,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227755564] [2025-03-08 02:07:45,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:45,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:45,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-08 02:07:45,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-08 02:07:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:07:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227755564] [2025-03-08 02:07:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227755564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:45,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:45,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083522942] [2025-03-08 02:07:45,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:45,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:45,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:45,328 INFO L87 Difference]: Start difference. First operand 11679 states and 13908 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:46,972 INFO L93 Difference]: Finished difference Result 30622 states and 36789 transitions. [2025-03-08 02:07:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-03-08 02:07:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:47,008 INFO L225 Difference]: With dead ends: 30622 [2025-03-08 02:07:47,008 INFO L226 Difference]: Without dead ends: 18080 [2025-03-08 02:07:47,017 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-08 02:07:47,018 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 482 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:47,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 711 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:07:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18080 states. [2025-03-08 02:07:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18080 to 16797. [2025-03-08 02:07:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16797 states, 16796 states have (on average 1.1992140985949036) internal successors, (20142), 16796 states have internal predecessors, (20142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16797 states to 16797 states and 20142 transitions. [2025-03-08 02:07:47,284 INFO L78 Accepts]: Start accepts. Automaton has 16797 states and 20142 transitions. Word has length 281 [2025-03-08 02:07:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:47,285 INFO L471 AbstractCegarLoop]: Abstraction has 16797 states and 20142 transitions. [2025-03-08 02:07:47,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 16797 states and 20142 transitions. [2025-03-08 02:07:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-08 02:07:47,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:47,290 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-08 02:07:47,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:07:47,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:47,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1892298480, now seen corresponding path program 1 times [2025-03-08 02:07:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445756884] [2025-03-08 02:07:47,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:47,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-08 02:07:47,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-08 02:07:47,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:47,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:07:47,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445756884] [2025-03-08 02:07:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445756884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:47,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:47,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:47,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167133826] [2025-03-08 02:07:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:47,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:47,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:47,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:47,539 INFO L87 Difference]: Start difference. First operand 16797 states and 20142 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:48,944 INFO L93 Difference]: Finished difference Result 43819 states and 52569 transitions. [2025-03-08 02:07:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:48,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 304 [2025-03-08 02:07:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:48,988 INFO L225 Difference]: With dead ends: 43819 [2025-03-08 02:07:48,989 INFO L226 Difference]: Without dead ends: 26592 [2025-03-08 02:07:49,006 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-08 02:07:49,007 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 446 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:49,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 319 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:07:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26592 states. [2025-03-08 02:07:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26592 to 24872. [2025-03-08 02:07:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24872 states, 24871 states have (on average 1.1865626633428492) internal successors, (29511), 24871 states have internal predecessors, (29511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24872 states to 24872 states and 29511 transitions. [2025-03-08 02:07:49,304 INFO L78 Accepts]: Start accepts. Automaton has 24872 states and 29511 transitions. Word has length 304 [2025-03-08 02:07:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:49,305 INFO L471 AbstractCegarLoop]: Abstraction has 24872 states and 29511 transitions. [2025-03-08 02:07:49,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 24872 states and 29511 transitions. [2025-03-08 02:07:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-08 02:07:49,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:49,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:49,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:07:49,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:49,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1261966405, now seen corresponding path program 1 times [2025-03-08 02:07:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044323694] [2025-03-08 02:07:49,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:49,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 02:07:49,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 02:07:49,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 293 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044323694] [2025-03-08 02:07:49,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044323694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967155882] [2025-03-08 02:07:49,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:49,843 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-08 02:07:49,844 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-08 02:07:49,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 02:07:49,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 02:07:49,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:49,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:49,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:07:49,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 236 proven. 82 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 02:07:50,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 236 proven. 82 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 02:07:51,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967155882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:07:51,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:07:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:07:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545729455] [2025-03-08 02:07:51,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:07:51,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:07:51,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:51,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:07:51,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:07:51,063 INFO L87 Difference]: Start difference. First operand 24872 states and 29511 transitions. Second operand has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:01,351 INFO L93 Difference]: Finished difference Result 118418 states and 138019 transitions. [2025-03-08 02:08:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 02:08:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 0 states have call successors, (0), 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 309 [2025-03-08 02:08:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:01,480 INFO L225 Difference]: With dead ends: 118418 [2025-03-08 02:08:01,481 INFO L226 Difference]: Without dead ends: 88443 [2025-03-08 02:08:01,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-08 02:08:01,502 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 10195 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 12578 mSolverCounterSat, 2915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10195 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 15493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2915 IncrementalHoareTripleChecker+Valid, 12578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:01,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10195 Valid, 580 Invalid, 15493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2915 Valid, 12578 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2025-03-08 02:08:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88443 states. [2025-03-08 02:08:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88443 to 81948. [2025-03-08 02:08:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81948 states, 81947 states have (on average 1.1485472317473489) internal successors, (94120), 81947 states have internal predecessors, (94120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81948 states to 81948 states and 94120 transitions. [2025-03-08 02:08:02,331 INFO L78 Accepts]: Start accepts. Automaton has 81948 states and 94120 transitions. Word has length 309 [2025-03-08 02:08:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:02,331 INFO L471 AbstractCegarLoop]: Abstraction has 81948 states and 94120 transitions. [2025-03-08 02:08:02,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 81948 states and 94120 transitions. [2025-03-08 02:08:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 02:08:02,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:02,336 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, 4, 4, 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, 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] [2025-03-08 02:08:02,572 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-08 02:08:02,767 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,SelfDestructingSolverStorable7 [2025-03-08 02:08:02,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:02,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1056608819, now seen corresponding path program 1 times [2025-03-08 02:08:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766699474] [2025-03-08 02:08:02,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:02,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 02:08:02,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 02:08:02,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:02,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 520 proven. 80 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 02:08:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:03,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766699474] [2025-03-08 02:08:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766699474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:03,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418702279] [2025-03-08 02:08:03,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:03,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:03,431 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-08 02:08:03,437 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-08 02:08:03,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 02:08:03,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 02:08:03,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:03,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:03,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:08:03,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 02:08:03,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:08:03,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418702279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:03,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:08:03,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 02:08:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802038521] [2025-03-08 02:08:03,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:03,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:08:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:03,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:08:03,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:08:03,991 INFO L87 Difference]: Start difference. First operand 81948 states and 94120 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:05,782 INFO L93 Difference]: Finished difference Result 166869 states and 191331 transitions. [2025-03-08 02:08:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:08:05,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 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 391 [2025-03-08 02:08:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:05,892 INFO L225 Difference]: With dead ends: 166869 [2025-03-08 02:08:05,893 INFO L226 Difference]: Without dead ends: 84923 [2025-03-08 02:08:05,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:08:05,932 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 840 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:05,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 365 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:08:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84923 states. [2025-03-08 02:08:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84923 to 83648. [2025-03-08 02:08:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83648 states, 83647 states have (on average 1.1460064317907397) internal successors, (95860), 83647 states have internal predecessors, (95860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83648 states to 83648 states and 95860 transitions. [2025-03-08 02:08:07,134 INFO L78 Accepts]: Start accepts. Automaton has 83648 states and 95860 transitions. Word has length 391 [2025-03-08 02:08:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:07,135 INFO L471 AbstractCegarLoop]: Abstraction has 83648 states and 95860 transitions. [2025-03-08 02:08:07,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 83648 states and 95860 transitions. [2025-03-08 02:08:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-08 02:08:07,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:07,145 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:07,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 02:08:07,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:07,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 943286186, now seen corresponding path program 1 times [2025-03-08 02:08:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598063804] [2025-03-08 02:08:07,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:07,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-08 02:08:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-08 02:08:07,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:08:07,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598063804] [2025-03-08 02:08:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598063804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:07,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:07,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:07,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066408442] [2025-03-08 02:08:07,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:07,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:07,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:07,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:07,534 INFO L87 Difference]: Start difference. First operand 83648 states and 95860 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:09,237 INFO L93 Difference]: Finished difference Result 178778 states and 205243 transitions. [2025-03-08 02:08:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 453 [2025-03-08 02:08:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:09,349 INFO L225 Difference]: With dead ends: 178778 [2025-03-08 02:08:09,349 INFO L226 Difference]: Without dead ends: 95132 [2025-03-08 02:08:09,407 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-08 02:08:09,408 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 496 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:09,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 736 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:08:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95132 states. [2025-03-08 02:08:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95132 to 92576. [2025-03-08 02:08:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92576 states, 92575 states have (on average 1.1426194977045638) internal successors, (105778), 92575 states have internal predecessors, (105778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92576 states to 92576 states and 105778 transitions. [2025-03-08 02:08:10,644 INFO L78 Accepts]: Start accepts. Automaton has 92576 states and 105778 transitions. Word has length 453 [2025-03-08 02:08:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:10,645 INFO L471 AbstractCegarLoop]: Abstraction has 92576 states and 105778 transitions. [2025-03-08 02:08:10,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 92576 states and 105778 transitions. [2025-03-08 02:08:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 02:08:10,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:10,651 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:08:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:08:10,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:10,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2042773506, now seen corresponding path program 1 times [2025-03-08 02:08:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135256094] [2025-03-08 02:08:10,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:10,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 02:08:10,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 02:08:10,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:10,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-03-08 02:08:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:11,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135256094] [2025-03-08 02:08:11,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135256094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:11,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589667083] [2025-03-08 02:08:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:11,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:11,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:11,301 INFO L87 Difference]: Start difference. First operand 92576 states and 105778 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:13,089 INFO L93 Difference]: Finished difference Result 205649 states and 234589 transitions. [2025-03-08 02:08:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 478 [2025-03-08 02:08:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:13,218 INFO L225 Difference]: With dead ends: 205649 [2025-03-08 02:08:13,218 INFO L226 Difference]: Without dead ends: 112645 [2025-03-08 02:08:13,268 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-08 02:08:13,268 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 478 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:13,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 237 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:08:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112645 states. [2025-03-08 02:08:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112645 to 96835. [2025-03-08 02:08:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96835 states, 96834 states have (on average 1.136945700890183) internal successors, (110095), 96834 states have internal predecessors, (110095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96835 states to 96835 states and 110095 transitions. [2025-03-08 02:08:14,667 INFO L78 Accepts]: Start accepts. Automaton has 96835 states and 110095 transitions. Word has length 478 [2025-03-08 02:08:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:14,668 INFO L471 AbstractCegarLoop]: Abstraction has 96835 states and 110095 transitions. [2025-03-08 02:08:14,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 96835 states and 110095 transitions. [2025-03-08 02:08:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-08 02:08:14,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:14,674 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:14,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:08:14,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:14,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:14,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1893799730, now seen corresponding path program 1 times [2025-03-08 02:08:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:14,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178623111] [2025-03-08 02:08:14,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:14,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:14,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-08 02:08:14,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-08 02:08:14,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:14,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-03-08 02:08:14,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:14,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178623111] [2025-03-08 02:08:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178623111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264149284] [2025-03-08 02:08:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:14,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:14,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:14,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:14,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:14,877 INFO L87 Difference]: Start difference. First operand 96835 states and 110095 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:16,233 INFO L93 Difference]: Finished difference Result 191534 states and 217767 transitions. [2025-03-08 02:08:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:16,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 507 [2025-03-08 02:08:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:16,335 INFO L225 Difference]: With dead ends: 191534 [2025-03-08 02:08:16,335 INFO L226 Difference]: Without dead ends: 94700 [2025-03-08 02:08:16,393 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-08 02:08:16,393 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 459 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:16,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 724 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:08:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94700 states. [2025-03-08 02:08:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94700 to 94698. [2025-03-08 02:08:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94698 states, 94697 states have (on average 1.1040687666979947) internal successors, (104552), 94697 states have internal predecessors, (104552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94698 states to 94698 states and 104552 transitions. [2025-03-08 02:08:17,638 INFO L78 Accepts]: Start accepts. Automaton has 94698 states and 104552 transitions. Word has length 507 [2025-03-08 02:08:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:17,639 INFO L471 AbstractCegarLoop]: Abstraction has 94698 states and 104552 transitions. [2025-03-08 02:08:17,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 94698 states and 104552 transitions. [2025-03-08 02:08:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-03-08 02:08:17,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:17,652 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:17,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:08:17,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:17,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash 257946737, now seen corresponding path program 1 times [2025-03-08 02:08:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672202545] [2025-03-08 02:08:17,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:17,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-03-08 02:08:17,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-03-08 02:08:17,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:17,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 788 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:08:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672202545] [2025-03-08 02:08:18,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672202545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:18,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:18,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:08:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389340589] [2025-03-08 02:08:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:18,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:08:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:18,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:08:18,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:08:18,129 INFO L87 Difference]: Start difference. First operand 94698 states and 104552 transitions. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:20,899 INFO L93 Difference]: Finished difference Result 249900 states and 274945 transitions. [2025-03-08 02:08:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:08:20,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 550 [2025-03-08 02:08:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:21,071 INFO L225 Difference]: With dead ends: 249900 [2025-03-08 02:08:21,071 INFO L226 Difference]: Without dead ends: 155204 [2025-03-08 02:08:21,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:08:21,105 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 793 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:21,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 220 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:08:21,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155204 states. [2025-03-08 02:08:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155204 to 132208. [2025-03-08 02:08:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132208 states, 132207 states have (on average 1.1014621010990342) internal successors, (145621), 132207 states have internal predecessors, (145621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132208 states to 132208 states and 145621 transitions. [2025-03-08 02:08:22,752 INFO L78 Accepts]: Start accepts. Automaton has 132208 states and 145621 transitions. Word has length 550 [2025-03-08 02:08:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:22,753 INFO L471 AbstractCegarLoop]: Abstraction has 132208 states and 145621 transitions. [2025-03-08 02:08:22,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 132208 states and 145621 transitions. [2025-03-08 02:08:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-03-08 02:08:22,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:22,766 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-08 02:08:22,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:08:22,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:22,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash -211823042, now seen corresponding path program 1 times [2025-03-08 02:08:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:22,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025816326] [2025-03-08 02:08:22,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:22,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:22,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-03-08 02:08:22,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-03-08 02:08:22,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:22,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 779 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-08 02:08:23,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:23,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025816326] [2025-03-08 02:08:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025816326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:23,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:23,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:23,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287257238] [2025-03-08 02:08:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:23,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:23,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:23,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:23,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:23,266 INFO L87 Difference]: Start difference. First operand 132208 states and 145621 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:25,083 INFO L93 Difference]: Finished difference Result 286986 states and 316644 transitions. [2025-03-08 02:08:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:25,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 552 [2025-03-08 02:08:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:25,276 INFO L225 Difference]: With dead ends: 286986 [2025-03-08 02:08:25,277 INFO L226 Difference]: Without dead ends: 154355 [2025-03-08 02:08:25,338 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-08 02:08:25,339 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 319 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:25,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 341 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:08:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154355 states. [2025-03-08 02:08:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154355 to 147945. [2025-03-08 02:08:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147945 states, 147944 states have (on average 1.0840858703293137) internal successors, (160384), 147944 states have internal predecessors, (160384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147945 states to 147945 states and 160384 transitions. [2025-03-08 02:08:27,180 INFO L78 Accepts]: Start accepts. Automaton has 147945 states and 160384 transitions. Word has length 552 [2025-03-08 02:08:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:27,181 INFO L471 AbstractCegarLoop]: Abstraction has 147945 states and 160384 transitions. [2025-03-08 02:08:27,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 147945 states and 160384 transitions. [2025-03-08 02:08:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 02:08:27,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:27,466 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:27,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:08:27,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:27,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2122891461, now seen corresponding path program 1 times [2025-03-08 02:08:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:27,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970887548] [2025-03-08 02:08:27,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:27,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:27,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 02:08:27,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 02:08:27,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:27,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 02:08:27,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:27,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970887548] [2025-03-08 02:08:27,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970887548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:27,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719402342] [2025-03-08 02:08:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:27,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:27,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:27,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:27,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:27,784 INFO L87 Difference]: Start difference. First operand 147945 states and 160384 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:29,622 INFO L93 Difference]: Finished difference Result 301004 states and 325978 transitions. [2025-03-08 02:08:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:29,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 577 [2025-03-08 02:08:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:29,814 INFO L225 Difference]: With dead ends: 301004 [2025-03-08 02:08:29,814 INFO L226 Difference]: Without dead ends: 152636 [2025-03-08 02:08:29,900 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-08 02:08:29,900 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 357 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:29,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 366 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:08:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152636 states. [2025-03-08 02:08:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152636 to 150465. [2025-03-08 02:08:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150465 states, 150464 states have (on average 1.074004413015738) internal successors, (161599), 150464 states have internal predecessors, (161599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150465 states to 150465 states and 161599 transitions. [2025-03-08 02:08:31,795 INFO L78 Accepts]: Start accepts. Automaton has 150465 states and 161599 transitions. Word has length 577 [2025-03-08 02:08:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:31,796 INFO L471 AbstractCegarLoop]: Abstraction has 150465 states and 161599 transitions. [2025-03-08 02:08:31,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 150465 states and 161599 transitions. [2025-03-08 02:08:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 02:08:31,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:31,809 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:31,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:08:31,809 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:31,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2145013107, now seen corresponding path program 1 times [2025-03-08 02:08:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:31,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324905576] [2025-03-08 02:08:31,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:31,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:32,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 02:08:32,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 02:08:32,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:32,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-08 02:08:32,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324905576] [2025-03-08 02:08:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324905576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:32,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:32,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995016326] [2025-03-08 02:08:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:32,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:32,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:32,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:32,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:32,329 INFO L87 Difference]: Start difference. First operand 150465 states and 161599 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:34,124 INFO L93 Difference]: Finished difference Result 315004 states and 337938 transitions. [2025-03-08 02:08:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 589 [2025-03-08 02:08:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:34,342 INFO L225 Difference]: With dead ends: 315004 [2025-03-08 02:08:34,342 INFO L226 Difference]: Without dead ends: 164540 [2025-03-08 02:08:34,431 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-08 02:08:34,432 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 325 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:34,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 831 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:08:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164540 states. [2025-03-08 02:08:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164540 to 158572. [2025-03-08 02:08:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158572 states, 158571 states have (on average 1.068549734819103) internal successors, (169441), 158571 states have internal predecessors, (169441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158572 states to 158572 states and 169441 transitions. [2025-03-08 02:08:36,392 INFO L78 Accepts]: Start accepts. Automaton has 158572 states and 169441 transitions. Word has length 589 [2025-03-08 02:08:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:36,392 INFO L471 AbstractCegarLoop]: Abstraction has 158572 states and 169441 transitions. [2025-03-08 02:08:36,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 158572 states and 169441 transitions. [2025-03-08 02:08:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-08 02:08:36,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:36,406 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:36,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:08:36,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:36,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1871947584, now seen corresponding path program 1 times [2025-03-08 02:08:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:36,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609652619] [2025-03-08 02:08:36,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:36,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-08 02:08:36,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-08 02:08:36,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:36,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:08:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:36,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609652619] [2025-03-08 02:08:36,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609652619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:36,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:36,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:36,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247796592] [2025-03-08 02:08:36,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:36,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:36,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:36,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:36,960 INFO L87 Difference]: Start difference. First operand 158572 states and 169441 transitions. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:38,784 INFO L93 Difference]: Finished difference Result 328656 states and 351199 transitions. [2025-03-08 02:08:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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 611 [2025-03-08 02:08:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:38,985 INFO L225 Difference]: With dead ends: 328656 [2025-03-08 02:08:38,985 INFO L226 Difference]: Without dead ends: 169658 [2025-03-08 02:08:39,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:39,065 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 464 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:39,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 212 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:08:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169658 states. [2025-03-08 02:08:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169658 to 159849. [2025-03-08 02:08:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159849 states, 159848 states have (on average 1.0677831439867875) internal successors, (170683), 159848 states have internal predecessors, (170683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159849 states to 159849 states and 170683 transitions. [2025-03-08 02:08:41,121 INFO L78 Accepts]: Start accepts. Automaton has 159849 states and 170683 transitions. Word has length 611 [2025-03-08 02:08:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:41,122 INFO L471 AbstractCegarLoop]: Abstraction has 159849 states and 170683 transitions. [2025-03-08 02:08:41,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 159849 states and 170683 transitions. [2025-03-08 02:08:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-08 02:08:41,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:41,135 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, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:41,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:08:41,136 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:41,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1880968693, now seen corresponding path program 1 times [2025-03-08 02:08:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417943278] [2025-03-08 02:08:41,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:41,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-08 02:08:41,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-08 02:08:41,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:41,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 494 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:08:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417943278] [2025-03-08 02:08:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417943278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907432226] [2025-03-08 02:08:41,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:41,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:08:41,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:08:42,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-08 02:08:42,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-08 02:08:42,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:42,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:42,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 02:08:42,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 355 proven. 47 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:08:42,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:08:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:08:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907432226] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:08:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-08 02:08:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894582670] [2025-03-08 02:08:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:42,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:08:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:42,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:08:42,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:08:42,499 INFO L87 Difference]: Start difference. First operand 159849 states and 170683 transitions. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:45,143 INFO L93 Difference]: Finished difference Result 337157 states and 359893 transitions. [2025-03-08 02:08:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:08:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 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 616 [2025-03-08 02:08:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:45,330 INFO L225 Difference]: With dead ends: 337157 [2025-03-08 02:08:45,330 INFO L226 Difference]: Without dead ends: 175607 [2025-03-08 02:08:45,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1228 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:08:45,426 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 928 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:45,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 196 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:08:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175607 states. [2025-03-08 02:08:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175607 to 170912. [2025-03-08 02:08:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170912 states, 170911 states have (on average 1.0675907343588182) internal successors, (182463), 170911 states have internal predecessors, (182463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170912 states to 170912 states and 182463 transitions. [2025-03-08 02:08:47,887 INFO L78 Accepts]: Start accepts. Automaton has 170912 states and 182463 transitions. Word has length 616 [2025-03-08 02:08:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:47,888 INFO L471 AbstractCegarLoop]: Abstraction has 170912 states and 182463 transitions. [2025-03-08 02:08:47,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 170912 states and 182463 transitions. [2025-03-08 02:08:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-03-08 02:08:47,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:47,897 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:08:47,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0