./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.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 c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:28:10,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:28:10,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:28:10,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:28:10,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:28:10,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:28:10,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:28:10,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:28:10,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:28:10,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:28:10,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:28:10,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:28:10,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:28:10,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:28:10,856 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:28:10,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:28:10,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:28:10,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:28:10,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:28:10,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:28:10,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:28:10,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:28:10,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:28:10,859 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 -> c3556d84b743029397591123c4f713fb54c922b0817fe8965ed5070f16a3f39a [2025-03-16 20:28:11,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:28:11,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:28:11,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:28:11,071 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:28:11,071 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:28:11,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:28:12,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8ca8203/7441622eaeb2419ebf74636087aeee92/FLAGb835e7a4c [2025-03-16 20:28:12,622 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:28:12,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:28:12,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8ca8203/7441622eaeb2419ebf74636087aeee92/FLAGb835e7a4c [2025-03-16 20:28:12,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8ca8203/7441622eaeb2419ebf74636087aeee92 [2025-03-16 20:28:12,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:28:12,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:28:12,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:28:12,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:28:12,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:28:12,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:28:12" (1/1) ... [2025-03-16 20:28:12,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4506c74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:12, skipping insertion in model container [2025-03-16 20:28:12,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:28:12" (1/1) ... [2025-03-16 20:28:12,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:28:13,109 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2025-03-16 20:28:13,152 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2025-03-16 20:28:13,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:28:13,549 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:28:13,580 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[11668,11681] [2025-03-16 20:28:13,591 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c[17223,17236] [2025-03-16 20:28:13,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:28:13,848 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:28:13,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13 WrapperNode [2025-03-16 20:28:13,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:28:13,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:28:13,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:28:13,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:28:13,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:13,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,148 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5091 [2025-03-16 20:28:14,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:28:14,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:28:14,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:28:14,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:28:14,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,332 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:28:14,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:28:14,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:28:14,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:28:14,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:28:14,557 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (1/1) ... [2025-03-16 20:28:14,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:28:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:14,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:28:14,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:28:14,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:28:14,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:28:14,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:28:14,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:28:14,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:28:14,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:28:18,080 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2025-03-16 20:28:18,081 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2025-03-16 20:28:18,081 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2025-03-16 20:28:18,206 INFO L? ?]: Removed 740 outVars from TransFormulas that were not future-live. [2025-03-16 20:28:18,206 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:28:18,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:28:18,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:28:18,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:28:18 BoogieIcfgContainer [2025-03-16 20:28:18,238 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:28:18,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:28:18,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:28:18,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:28:18,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:28:12" (1/3) ... [2025-03-16 20:28:18,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c19ff0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:28:18, skipping insertion in model container [2025-03-16 20:28:18,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:28:13" (2/3) ... [2025-03-16 20:28:18,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c19ff0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:28:18, skipping insertion in model container [2025-03-16 20:28:18,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:28:18" (3/3) ... [2025-03-16 20:28:18,248 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:28:18,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:28:18,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 836 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:28:18,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:28:18,329 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;@3baf1060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:28:18,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:28:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:28:18,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:18,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:18,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash -264315576, now seen corresponding path program 1 times [2025-03-16 20:28:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:18,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394840819] [2025-03-16 20:28:18,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:18,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:28:18,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:28:18,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:18,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:18,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394840819] [2025-03-16 20:28:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394840819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:18,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:18,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:28:18,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215026021] [2025-03-16 20:28:18,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:18,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:28:18,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:18,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:28:18,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:28:18,564 INFO L87 Difference]: Start difference. First operand has 836 states, 833 states have (on average 1.972388955582233) internal successors, (1643), 835 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:18,638 INFO L93 Difference]: Finished difference Result 1637 states and 3218 transitions. [2025-03-16 20:28:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:28:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 20:28:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:18,653 INFO L225 Difference]: With dead ends: 1637 [2025-03-16 20:28:18,653 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:28:18,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:28:18,658 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:18,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:28:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 20:28:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8963855421686746) internal successors, (1574), 831 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1574 transitions. [2025-03-16 20:28:18,717 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1574 transitions. Word has length 21 [2025-03-16 20:28:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:18,717 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1574 transitions. [2025-03-16 20:28:18,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1574 transitions. [2025-03-16 20:28:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 20:28:18,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:18,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:18,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:28:18,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:18,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1088994121, now seen corresponding path program 1 times [2025-03-16 20:28:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926150239] [2025-03-16 20:28:18,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:18,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 20:28:18,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 20:28:18,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:18,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:18,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926150239] [2025-03-16 20:28:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926150239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:18,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:18,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:28:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180833996] [2025-03-16 20:28:18,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:28:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:18,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:28:18,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:28:18,913 INFO L87 Difference]: Start difference. First operand 832 states and 1574 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:18,979 INFO L93 Difference]: Finished difference Result 878 states and 1646 transitions. [2025-03-16 20:28:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:28:18,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 20:28:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:18,982 INFO L225 Difference]: With dead ends: 878 [2025-03-16 20:28:18,982 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:28:18,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:28:18,983 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 0 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:18,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4684 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:28:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2025-03-16 20:28:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8590361445783132) internal successors, (1543), 831 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1543 transitions. [2025-03-16 20:28:19,000 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1543 transitions. Word has length 21 [2025-03-16 20:28:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:19,000 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1543 transitions. [2025-03-16 20:28:19,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1543 transitions. [2025-03-16 20:28:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:28:19,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:19,002 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] [2025-03-16 20:28:19,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:28:19,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:19,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash 929110903, now seen corresponding path program 1 times [2025-03-16 20:28:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512290581] [2025-03-16 20:28:19,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:19,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:28:19,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:28:19,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:19,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:19,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:19,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512290581] [2025-03-16 20:28:19,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512290581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:19,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:19,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99944463] [2025-03-16 20:28:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:19,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:28:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:19,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:28:19,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:28:19,191 INFO L87 Difference]: Start difference. First operand 832 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:23,806 INFO L93 Difference]: Finished difference Result 3087 states and 5852 transitions. [2025-03-16 20:28:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:28:23,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:28:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:23,816 INFO L225 Difference]: With dead ends: 3087 [2025-03-16 20:28:23,816 INFO L226 Difference]: Without dead ends: 2334 [2025-03-16 20:28:23,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:28:23,817 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 2426 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2426 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:23,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2426 Valid, 797 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 20:28:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2025-03-16 20:28:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2334. [2025-03-16 20:28:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 2332 states have (on average 1.5681818181818181) internal successors, (3657), 2333 states have internal predecessors, (3657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3657 transitions. [2025-03-16 20:28:23,892 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3657 transitions. Word has length 47 [2025-03-16 20:28:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:23,893 INFO L471 AbstractCegarLoop]: Abstraction has 2334 states and 3657 transitions. [2025-03-16 20:28:23,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3657 transitions. [2025-03-16 20:28:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:28:23,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:23,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:23,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:28:23,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:23,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -586643669, now seen corresponding path program 1 times [2025-03-16 20:28:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:23,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045029648] [2025-03-16 20:28:23,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:23,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:28:23,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:28:23,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:23,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:24,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:24,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045029648] [2025-03-16 20:28:24,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045029648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:24,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:24,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181660519] [2025-03-16 20:28:24,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:24,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:24,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:24,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:24,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:24,142 INFO L87 Difference]: Start difference. First operand 2334 states and 3657 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:24,297 INFO L93 Difference]: Finished difference Result 2764 states and 4347 transitions. [2025-03-16 20:28:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:28:24,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 20:28:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:24,305 INFO L225 Difference]: With dead ends: 2764 [2025-03-16 20:28:24,306 INFO L226 Difference]: Without dead ends: 2721 [2025-03-16 20:28:24,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 20:28:24,308 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 8015 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8015 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:24,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8015 Valid, 2520 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2025-03-16 20:28:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2375. [2025-03-16 20:28:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2373 states have (on average 1.5689001264222504) internal successors, (3723), 2374 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3723 transitions. [2025-03-16 20:28:24,350 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3723 transitions. Word has length 51 [2025-03-16 20:28:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:24,350 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3723 transitions. [2025-03-16 20:28:24,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3723 transitions. [2025-03-16 20:28:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:28:24,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:24,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:24,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:28:24,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1086667923, now seen corresponding path program 1 times [2025-03-16 20:28:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488070616] [2025-03-16 20:28:24,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:24,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:28:24,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:28:24,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:24,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:24,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488070616] [2025-03-16 20:28:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488070616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:24,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961172136] [2025-03-16 20:28:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:24,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:24,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:24,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:24,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:24,583 INFO L87 Difference]: Start difference. First operand 2375 states and 3723 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:24,715 INFO L93 Difference]: Finished difference Result 2461 states and 3859 transitions. [2025-03-16 20:28:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:28:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:24,723 INFO L225 Difference]: With dead ends: 2461 [2025-03-16 20:28:24,723 INFO L226 Difference]: Without dead ends: 2377 [2025-03-16 20:28:24,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:28:24,725 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 4482 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:24,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 1800 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-16 20:28:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2375. [2025-03-16 20:28:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2373 states have (on average 1.5684787189211968) internal successors, (3722), 2374 states have internal predecessors, (3722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3722 transitions. [2025-03-16 20:28:24,759 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3722 transitions. Word has length 53 [2025-03-16 20:28:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:24,760 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3722 transitions. [2025-03-16 20:28:24,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3722 transitions. [2025-03-16 20:28:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:28:24,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:24,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:24,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:28:24,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:24,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1087710608, now seen corresponding path program 1 times [2025-03-16 20:28:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637568924] [2025-03-16 20:28:24,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:24,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:28:24,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:28:24,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:24,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637568924] [2025-03-16 20:28:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637568924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:24,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:24,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:24,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997532370] [2025-03-16 20:28:24,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:24,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:24,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:24,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:24,867 INFO L87 Difference]: Start difference. First operand 2375 states and 3722 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:24,894 INFO L93 Difference]: Finished difference Result 2532 states and 3971 transitions. [2025-03-16 20:28:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:24,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:28:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:24,901 INFO L225 Difference]: With dead ends: 2532 [2025-03-16 20:28:24,902 INFO L226 Difference]: Without dead ends: 2448 [2025-03-16 20:28:24,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:24,903 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:24,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1601 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2025-03-16 20:28:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2444. [2025-03-16 20:28:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2442 states have (on average 1.567977067977068) internal successors, (3829), 2443 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3829 transitions. [2025-03-16 20:28:24,971 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3829 transitions. Word has length 53 [2025-03-16 20:28:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:24,972 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3829 transitions. [2025-03-16 20:28:24,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3829 transitions. [2025-03-16 20:28:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 20:28:24,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:24,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:24,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:28:24,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:24,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash 674017815, now seen corresponding path program 1 times [2025-03-16 20:28:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:24,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538679506] [2025-03-16 20:28:24,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:24,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 20:28:24,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 20:28:24,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:24,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:25,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538679506] [2025-03-16 20:28:25,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538679506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:25,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:25,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:28:25,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948394853] [2025-03-16 20:28:25,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:25,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:28:25,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:25,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:28:25,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:28:25,181 INFO L87 Difference]: Start difference. First operand 2444 states and 3829 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:25,216 INFO L93 Difference]: Finished difference Result 2450 states and 3836 transitions. [2025-03-16 20:28:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:28:25,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-16 20:28:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:25,224 INFO L225 Difference]: With dead ends: 2450 [2025-03-16 20:28:25,224 INFO L226 Difference]: Without dead ends: 2448 [2025-03-16 20:28:25,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:28:25,225 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 0 mSDsluCounter, 6145 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7684 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:25,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7684 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2025-03-16 20:28:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2448. [2025-03-16 20:28:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2446 states have (on average 1.5666394112837285) internal successors, (3832), 2447 states have internal predecessors, (3832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3832 transitions. [2025-03-16 20:28:25,259 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3832 transitions. Word has length 54 [2025-03-16 20:28:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:25,259 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 3832 transitions. [2025-03-16 20:28:25,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3832 transitions. [2025-03-16 20:28:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:25,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:25,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:25,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:28:25,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 232477583, now seen corresponding path program 1 times [2025-03-16 20:28:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774198696] [2025-03-16 20:28:25,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:25,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:25,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:25,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:25,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774198696] [2025-03-16 20:28:25,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774198696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:25,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:25,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904953136] [2025-03-16 20:28:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:25,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:25,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:25,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:25,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,307 INFO L87 Difference]: Start difference. First operand 2448 states and 3832 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:25,330 INFO L93 Difference]: Finished difference Result 2746 states and 4292 transitions. [2025-03-16 20:28:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 20:28:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:25,338 INFO L225 Difference]: With dead ends: 2746 [2025-03-16 20:28:25,338 INFO L226 Difference]: Without dead ends: 2589 [2025-03-16 20:28:25,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,339 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1495 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:25,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2025-03-16 20:28:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2587. [2025-03-16 20:28:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2585 states have (on average 1.5640232108317216) internal successors, (4043), 2586 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 4043 transitions. [2025-03-16 20:28:25,377 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 4043 transitions. Word has length 55 [2025-03-16 20:28:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:25,378 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 4043 transitions. [2025-03-16 20:28:25,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 4043 transitions. [2025-03-16 20:28:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:25,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:25,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:25,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:28:25,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:25,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash 989518223, now seen corresponding path program 1 times [2025-03-16 20:28:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719567623] [2025-03-16 20:28:25,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:25,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:25,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:25,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:25,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719567623] [2025-03-16 20:28:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719567623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:25,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848050318] [2025-03-16 20:28:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:25,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:25,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:25,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,426 INFO L87 Difference]: Start difference. First operand 2587 states and 4043 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:25,449 INFO L93 Difference]: Finished difference Result 3147 states and 4897 transitions. [2025-03-16 20:28:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:25,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 20:28:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:25,456 INFO L225 Difference]: With dead ends: 3147 [2025-03-16 20:28:25,457 INFO L226 Difference]: Without dead ends: 2851 [2025-03-16 20:28:25,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,458 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 1491 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:25,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1659 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-03-16 20:28:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2849. [2025-03-16 20:28:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2847 states have (on average 1.5570776255707763) internal successors, (4433), 2848 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 4433 transitions. [2025-03-16 20:28:25,502 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 4433 transitions. Word has length 55 [2025-03-16 20:28:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:25,502 INFO L471 AbstractCegarLoop]: Abstraction has 2849 states and 4433 transitions. [2025-03-16 20:28:25,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 4433 transitions. [2025-03-16 20:28:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:25,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:25,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:25,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:28:25,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash 439729295, now seen corresponding path program 1 times [2025-03-16 20:28:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987905906] [2025-03-16 20:28:25,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:25,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:25,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:25,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:25,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987905906] [2025-03-16 20:28:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987905906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682628673] [2025-03-16 20:28:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:25,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:25,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:25,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:25,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,570 INFO L87 Difference]: Start difference. First operand 2849 states and 4433 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:25,600 INFO L93 Difference]: Finished difference Result 3901 states and 6011 transitions. [2025-03-16 20:28:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:25,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 20:28:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:25,609 INFO L225 Difference]: With dead ends: 3901 [2025-03-16 20:28:25,609 INFO L226 Difference]: Without dead ends: 3343 [2025-03-16 20:28:25,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,611 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 1489 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:25,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1661 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2025-03-16 20:28:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 3341. [2025-03-16 20:28:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3339 states have (on average 1.5420784666067684) internal successors, (5149), 3340 states have internal predecessors, (5149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 5149 transitions. [2025-03-16 20:28:25,665 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 5149 transitions. Word has length 55 [2025-03-16 20:28:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:25,665 INFO L471 AbstractCegarLoop]: Abstraction has 3341 states and 5149 transitions. [2025-03-16 20:28:25,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 5149 transitions. [2025-03-16 20:28:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:28:25,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:25,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:28:25,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:25,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1055700623, now seen corresponding path program 1 times [2025-03-16 20:28:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093078428] [2025-03-16 20:28:25,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:25,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:28:25,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:28:25,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:25,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:25,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093078428] [2025-03-16 20:28:25,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093078428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:25,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:25,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374643345] [2025-03-16 20:28:25,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:25,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:25,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:25,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:25,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,705 INFO L87 Difference]: Start difference. First operand 3341 states and 5149 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:25,742 INFO L93 Difference]: Finished difference Result 5313 states and 8047 transitions. [2025-03-16 20:28:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 20:28:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:25,753 INFO L225 Difference]: With dead ends: 5313 [2025-03-16 20:28:25,753 INFO L226 Difference]: Without dead ends: 4263 [2025-03-16 20:28:25,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,755 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1493 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:25,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1665 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-03-16 20:28:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4261. [2025-03-16 20:28:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 4259 states have (on average 1.5151444000939187) internal successors, (6453), 4260 states have internal predecessors, (6453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6453 transitions. [2025-03-16 20:28:25,830 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6453 transitions. Word has length 55 [2025-03-16 20:28:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:25,831 INFO L471 AbstractCegarLoop]: Abstraction has 4261 states and 6453 transitions. [2025-03-16 20:28:25,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6453 transitions. [2025-03-16 20:28:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:28:25,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:25,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:25,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:28:25,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:25,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -441912209, now seen corresponding path program 1 times [2025-03-16 20:28:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434224108] [2025-03-16 20:28:25,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:25,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:28:25,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:28:25,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:25,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:25,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434224108] [2025-03-16 20:28:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434224108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:25,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59046659] [2025-03-16 20:28:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:25,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:25,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:25,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,868 INFO L87 Difference]: Start difference. First operand 4261 states and 6453 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:25,917 INFO L93 Difference]: Finished difference Result 6316 states and 9499 transitions. [2025-03-16 20:28:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 20:28:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:25,926 INFO L225 Difference]: With dead ends: 6316 [2025-03-16 20:28:25,927 INFO L226 Difference]: Without dead ends: 5193 [2025-03-16 20:28:25,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:25,930 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 1494 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:25,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1664 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2025-03-16 20:28:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 5191. [2025-03-16 20:28:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 5189 states have (on average 1.499903642320293) internal successors, (7783), 5190 states have internal predecessors, (7783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7783 transitions. [2025-03-16 20:28:26,056 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7783 transitions. Word has length 57 [2025-03-16 20:28:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:26,056 INFO L471 AbstractCegarLoop]: Abstraction has 5191 states and 7783 transitions. [2025-03-16 20:28:26,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7783 transitions. [2025-03-16 20:28:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:26,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:26,058 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:26,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:28:26,058 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:26,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:26,058 INFO L85 PathProgramCache]: Analyzing trace with hash 289567166, now seen corresponding path program 1 times [2025-03-16 20:28:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939438585] [2025-03-16 20:28:26,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:26,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:26,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:26,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:26,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:28:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939438585] [2025-03-16 20:28:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939438585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:26,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:26,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043267829] [2025-03-16 20:28:26,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:26,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:26,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:26,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:26,209 INFO L87 Difference]: Start difference. First operand 5191 states and 7783 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:26,536 INFO L93 Difference]: Finished difference Result 20291 states and 29597 transitions. [2025-03-16 20:28:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:26,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2025-03-16 20:28:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:26,563 INFO L225 Difference]: With dead ends: 20291 [2025-03-16 20:28:26,563 INFO L226 Difference]: Without dead ends: 17393 [2025-03-16 20:28:26,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:26,569 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6364 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6364 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:26,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6364 Valid, 3554 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17393 states. [2025-03-16 20:28:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17393 to 8087. [2025-03-16 20:28:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8087 states, 8085 states have (on average 1.4752009894867038) internal successors, (11927), 8086 states have internal predecessors, (11927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8087 states to 8087 states and 11927 transitions. [2025-03-16 20:28:26,741 INFO L78 Accepts]: Start accepts. Automaton has 8087 states and 11927 transitions. Word has length 73 [2025-03-16 20:28:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:26,741 INFO L471 AbstractCegarLoop]: Abstraction has 8087 states and 11927 transitions. [2025-03-16 20:28:26,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8087 states and 11927 transitions. [2025-03-16 20:28:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:26,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:26,743 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:26,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:28:26,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:26,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1046607806, now seen corresponding path program 1 times [2025-03-16 20:28:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695359459] [2025-03-16 20:28:26,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:26,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:26,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:26,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:26,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:28:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695359459] [2025-03-16 20:28:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695359459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:26,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:26,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329499138] [2025-03-16 20:28:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:26,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:26,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:26,870 INFO L87 Difference]: Start difference. First operand 8087 states and 11927 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:27,185 INFO L93 Difference]: Finished difference Result 23187 states and 33741 transitions. [2025-03-16 20:28:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:27,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 73 [2025-03-16 20:28:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:27,218 INFO L225 Difference]: With dead ends: 23187 [2025-03-16 20:28:27,218 INFO L226 Difference]: Without dead ends: 20289 [2025-03-16 20:28:27,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:27,226 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 6410 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6410 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:27,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6410 Valid, 3525 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20289 states. [2025-03-16 20:28:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20289 to 12439. [2025-03-16 20:28:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12439 states, 12437 states have (on average 1.4555761035619523) internal successors, (18103), 12438 states have internal predecessors, (18103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 18103 transitions. [2025-03-16 20:28:27,604 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 18103 transitions. Word has length 73 [2025-03-16 20:28:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:27,604 INFO L471 AbstractCegarLoop]: Abstraction has 12439 states and 18103 transitions. [2025-03-16 20:28:27,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 18103 transitions. [2025-03-16 20:28:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:27,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:27,606 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:27,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:28:27,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:27,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 496818878, now seen corresponding path program 1 times [2025-03-16 20:28:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139276218] [2025-03-16 20:28:27,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:27,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:27,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:27,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:27,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:28:27,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:27,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139276218] [2025-03-16 20:28:27,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139276218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:27,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:27,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:27,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814296005] [2025-03-16 20:28:27,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:27,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:27,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:27,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:27,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:27,718 INFO L87 Difference]: Start difference. First operand 12439 states and 18103 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:28,057 INFO L93 Difference]: Finished difference Result 26083 states and 37885 transitions. [2025-03-16 20:28:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 73 [2025-03-16 20:28:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:28,097 INFO L225 Difference]: With dead ends: 26083 [2025-03-16 20:28:28,097 INFO L226 Difference]: Without dead ends: 23185 [2025-03-16 20:28:28,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:28,107 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6373 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6373 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:28,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6373 Valid, 3525 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23185 states. [2025-03-16 20:28:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23185 to 15335. [2025-03-16 20:28:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15335 states, 15333 states have (on average 1.4509228461488293) internal successors, (22247), 15334 states have internal predecessors, (22247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15335 states to 15335 states and 22247 transitions. [2025-03-16 20:28:28,440 INFO L78 Accepts]: Start accepts. Automaton has 15335 states and 22247 transitions. Word has length 73 [2025-03-16 20:28:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:28,440 INFO L471 AbstractCegarLoop]: Abstraction has 15335 states and 22247 transitions. [2025-03-16 20:28:28,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 15335 states and 22247 transitions. [2025-03-16 20:28:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:28:28,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:28,442 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:28,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:28:28,442 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1112790206, now seen corresponding path program 1 times [2025-03-16 20:28:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227275820] [2025-03-16 20:28:28,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:28,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:28:28,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:28:28,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:28,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:28:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227275820] [2025-03-16 20:28:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227275820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872761142] [2025-03-16 20:28:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:28,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:28,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:28,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:28,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:28,761 INFO L87 Difference]: Start difference. First operand 15335 states and 22247 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:29,244 INFO L93 Difference]: Finished difference Result 28979 states and 42029 transitions. [2025-03-16 20:28:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 73 [2025-03-16 20:28:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:29,278 INFO L225 Difference]: With dead ends: 28979 [2025-03-16 20:28:29,278 INFO L226 Difference]: Without dead ends: 26081 [2025-03-16 20:28:29,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:29,285 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6321 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6321 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:29,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6321 Valid, 3586 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26081 states. [2025-03-16 20:28:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26081 to 18231. [2025-03-16 20:28:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18231 states, 18229 states have (on average 1.4477480936968568) internal successors, (26391), 18230 states have internal predecessors, (26391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18231 states to 18231 states and 26391 transitions. [2025-03-16 20:28:29,647 INFO L78 Accepts]: Start accepts. Automaton has 18231 states and 26391 transitions. Word has length 73 [2025-03-16 20:28:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:29,648 INFO L471 AbstractCegarLoop]: Abstraction has 18231 states and 26391 transitions. [2025-03-16 20:28:29,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18231 states and 26391 transitions. [2025-03-16 20:28:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:28:29,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:29,650 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:28:29,650 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:29,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash -861645504, now seen corresponding path program 1 times [2025-03-16 20:28:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144911029] [2025-03-16 20:28:29,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:29,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:28:29,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:28:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144911029] [2025-03-16 20:28:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144911029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:29,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:29,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:29,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145721039] [2025-03-16 20:28:29,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:29,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:29,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:29,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:29,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:29,717 INFO L87 Difference]: Start difference. First operand 18231 states and 26391 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:29,968 INFO L93 Difference]: Finished difference Result 29518 states and 42781 transitions. [2025-03-16 20:28:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-16 20:28:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:29,993 INFO L225 Difference]: With dead ends: 29518 [2025-03-16 20:28:29,993 INFO L226 Difference]: Without dead ends: 13580 [2025-03-16 20:28:30,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:30,003 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 50 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:30,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3111 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13580 states. [2025-03-16 20:28:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13580 to 13578. [2025-03-16 20:28:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13578 states, 13576 states have (on average 1.4586034177961107) internal successors, (19802), 13577 states have internal predecessors, (19802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13578 states to 13578 states and 19802 transitions. [2025-03-16 20:28:30,283 INFO L78 Accepts]: Start accepts. Automaton has 13578 states and 19802 transitions. Word has length 75 [2025-03-16 20:28:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:30,283 INFO L471 AbstractCegarLoop]: Abstraction has 13578 states and 19802 transitions. [2025-03-16 20:28:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13578 states and 19802 transitions. [2025-03-16 20:28:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 20:28:30,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:30,284 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:30,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:28:30,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1413397794, now seen corresponding path program 1 times [2025-03-16 20:28:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:30,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390455428] [2025-03-16 20:28:30,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 20:28:30,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 20:28:30,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:30,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:28:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:30,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390455428] [2025-03-16 20:28:30,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390455428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 20:28:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150175866] [2025-03-16 20:28:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:30,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 20:28:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:30,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 20:28:30,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:28:30,461 INFO L87 Difference]: Start difference. First operand 13578 states and 19802 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:30,806 INFO L93 Difference]: Finished difference Result 23830 states and 34688 transitions. [2025-03-16 20:28:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:28:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 75 [2025-03-16 20:28:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:30,828 INFO L225 Difference]: With dead ends: 23830 [2025-03-16 20:28:30,829 INFO L226 Difference]: Without dead ends: 21780 [2025-03-16 20:28:30,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:28:30,833 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6371 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6371 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:30,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6371 Valid, 3622 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:28:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21780 states. [2025-03-16 20:28:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21780 to 15626. [2025-03-16 20:28:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15626 states, 15624 states have (on average 1.4558371735791091) internal successors, (22746), 15625 states have internal predecessors, (22746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15626 states to 15626 states and 22746 transitions. [2025-03-16 20:28:31,181 INFO L78 Accepts]: Start accepts. Automaton has 15626 states and 22746 transitions. Word has length 75 [2025-03-16 20:28:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:31,181 INFO L471 AbstractCegarLoop]: Abstraction has 15626 states and 22746 transitions. [2025-03-16 20:28:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15626 states and 22746 transitions. [2025-03-16 20:28:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 20:28:31,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:31,185 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:31,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:28:31,185 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 936423678, now seen corresponding path program 1 times [2025-03-16 20:28:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880264059] [2025-03-16 20:28:31,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:31,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 20:28:31,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 20:28:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:31,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:31,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:31,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880264059] [2025-03-16 20:28:31,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880264059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:31,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:31,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:31,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218299909] [2025-03-16 20:28:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:31,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:31,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:31,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:31,364 INFO L87 Difference]: Start difference. First operand 15626 states and 22746 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:31,592 INFO L93 Difference]: Finished difference Result 22286 states and 32316 transitions. [2025-03-16 20:28:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:31,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 20:28:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:31,609 INFO L225 Difference]: With dead ends: 22286 [2025-03-16 20:28:31,609 INFO L226 Difference]: Without dead ends: 8972 [2025-03-16 20:28:31,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:31,621 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 45 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:31,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3096 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8972 states. [2025-03-16 20:28:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8972 to 8970. [2025-03-16 20:28:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8970 states, 8968 states have (on average 1.457850133809099) internal successors, (13074), 8969 states have internal predecessors, (13074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8970 states to 8970 states and 13074 transitions. [2025-03-16 20:28:31,769 INFO L78 Accepts]: Start accepts. Automaton has 8970 states and 13074 transitions. Word has length 76 [2025-03-16 20:28:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:31,770 INFO L471 AbstractCegarLoop]: Abstraction has 8970 states and 13074 transitions. [2025-03-16 20:28:31,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 8970 states and 13074 transitions. [2025-03-16 20:28:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 20:28:31,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:31,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:31,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:28:31,772 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:31,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1884587529, now seen corresponding path program 1 times [2025-03-16 20:28:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363735662] [2025-03-16 20:28:31,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:31,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 20:28:31,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 20:28:31,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:31,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363735662] [2025-03-16 20:28:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363735662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226908585] [2025-03-16 20:28:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:31,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:31,866 INFO L87 Difference]: Start difference. First operand 8970 states and 13074 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:31,930 INFO L93 Difference]: Finished difference Result 12302 states and 17808 transitions. [2025-03-16 20:28:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:31,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 20:28:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:31,940 INFO L225 Difference]: With dead ends: 12302 [2025-03-16 20:28:31,941 INFO L226 Difference]: Without dead ends: 5644 [2025-03-16 20:28:31,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:31,948 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 42 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3081 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:31,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3081 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2025-03-16 20:28:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 5642. [2025-03-16 20:28:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5642 states, 5640 states have (on average 1.4698581560283688) internal successors, (8290), 5641 states have internal predecessors, (8290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 8290 transitions. [2025-03-16 20:28:32,034 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 8290 transitions. Word has length 78 [2025-03-16 20:28:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:32,034 INFO L471 AbstractCegarLoop]: Abstraction has 5642 states and 8290 transitions. [2025-03-16 20:28:32,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 8290 transitions. [2025-03-16 20:28:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 20:28:32,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:32,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:28:32,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:28:32,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:32,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1516299760, now seen corresponding path program 1 times [2025-03-16 20:28:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:32,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843939445] [2025-03-16 20:28:32,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:32,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 20:28:32,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 20:28:32,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:32,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:32,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843939445] [2025-03-16 20:28:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843939445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:32,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672078981] [2025-03-16 20:28:32,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:32,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:32,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:32,100 INFO L87 Difference]: Start difference. First operand 5642 states and 8290 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:32,139 INFO L93 Difference]: Finished difference Result 7310 states and 10632 transitions. [2025-03-16 20:28:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-16 20:28:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:32,147 INFO L225 Difference]: With dead ends: 7310 [2025-03-16 20:28:32,147 INFO L226 Difference]: Without dead ends: 3980 [2025-03-16 20:28:32,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:32,151 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 39 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:32,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3066 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2025-03-16 20:28:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3978. [2025-03-16 20:28:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3976 states have (on average 1.4899396378269618) internal successors, (5924), 3977 states have internal predecessors, (5924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5924 transitions. [2025-03-16 20:28:32,201 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5924 transitions. Word has length 80 [2025-03-16 20:28:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:32,201 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 5924 transitions. [2025-03-16 20:28:32,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5924 transitions. [2025-03-16 20:28:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 20:28:32,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:32,202 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:32,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:28:32,203 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:32,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:32,203 INFO L85 PathProgramCache]: Analyzing trace with hash -260930327, now seen corresponding path program 1 times [2025-03-16 20:28:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24131908] [2025-03-16 20:28:32,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:32,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 20:28:32,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 20:28:32,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:32,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:32,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:32,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24131908] [2025-03-16 20:28:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24131908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:28:32,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:28:32,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:28:32,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628818459] [2025-03-16 20:28:32,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:28:32,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:28:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:32,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:28:32,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:32,259 INFO L87 Difference]: Start difference. First operand 3978 states and 5924 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:32,287 INFO L93 Difference]: Finished difference Result 4814 states and 7083 transitions. [2025-03-16 20:28:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:28:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-16 20:28:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:32,295 INFO L225 Difference]: With dead ends: 4814 [2025-03-16 20:28:32,295 INFO L226 Difference]: Without dead ends: 3148 [2025-03-16 20:28:32,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:28:32,300 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 36 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:32,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3051 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:28:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-03-16 20:28:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3146. [2025-03-16 20:28:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3144 states have (on average 1.512086513994911) internal successors, (4754), 3145 states have internal predecessors, (4754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4754 transitions. [2025-03-16 20:28:32,332 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4754 transitions. Word has length 82 [2025-03-16 20:28:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:32,333 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4754 transitions. [2025-03-16 20:28:32,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4754 transitions. [2025-03-16 20:28:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 20:28:32,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:32,334 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:32,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:28:32,334 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:32,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1013848350, now seen corresponding path program 1 times [2025-03-16 20:28:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287524593] [2025-03-16 20:28:32,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:32,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:32,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:32,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:32,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287524593] [2025-03-16 20:28:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287524593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544326615] [2025-03-16 20:28:32,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:32,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:32,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:28:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 20:28:33,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 20:28:33,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:33,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:33,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:28:33,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:33,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:33,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544326615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:33,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:33,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:28:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164278576] [2025-03-16 20:28:33,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:28:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:33,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:28:33,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:28:33,525 INFO L87 Difference]: Start difference. First operand 3146 states and 4754 transitions. Second operand has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:36,596 INFO L93 Difference]: Finished difference Result 11016 states and 15387 transitions. [2025-03-16 20:28:36,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:28:36,597 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 20:28:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:36,613 INFO L225 Difference]: With dead ends: 11016 [2025-03-16 20:28:36,613 INFO L226 Difference]: Without dead ends: 10096 [2025-03-16 20:28:36,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1278, Invalid=6912, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:28:36,617 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 15210 mSDsluCounter, 8236 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15210 SdHoareTripleChecker+Valid, 9764 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:36,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15210 Valid, 9764 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 20:28:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10096 states. [2025-03-16 20:28:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10096 to 9538. [2025-03-16 20:28:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9538 states, 9536 states have (on average 1.386535234899329) internal successors, (13222), 9537 states have internal predecessors, (13222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9538 states to 9538 states and 13222 transitions. [2025-03-16 20:28:36,882 INFO L78 Accepts]: Start accepts. Automaton has 9538 states and 13222 transitions. Word has length 84 [2025-03-16 20:28:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:36,882 INFO L471 AbstractCegarLoop]: Abstraction has 9538 states and 13222 transitions. [2025-03-16 20:28:36,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.523809523809524) internal successors, (242), 21 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 9538 states and 13222 transitions. [2025-03-16 20:28:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:28:36,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:36,883 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:36,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:28:37,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 20:28:37,085 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:37,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1253413577, now seen corresponding path program 1 times [2025-03-16 20:28:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:37,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538840603] [2025-03-16 20:28:37,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:37,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:37,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:37,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:37,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538840603] [2025-03-16 20:28:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538840603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730180989] [2025-03-16 20:28:37,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:37,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:37,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:37,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:37,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:28:37,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:37,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:37,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:37,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:37,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:28:37,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:37,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:38,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730180989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:38,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:38,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:28:38,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19817880] [2025-03-16 20:28:38,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:28:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:38,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:28:38,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:28:38,529 INFO L87 Difference]: Start difference. First operand 9538 states and 13222 transitions. Second operand has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:39,179 INFO L93 Difference]: Finished difference Result 16848 states and 22972 transitions. [2025-03-16 20:28:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:28:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 20:28:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:39,195 INFO L225 Difference]: With dead ends: 16848 [2025-03-16 20:28:39,196 INFO L226 Difference]: Without dead ends: 9806 [2025-03-16 20:28:39,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:28:39,205 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 10644 mSDsluCounter, 3330 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10644 SdHoareTripleChecker+Valid, 4840 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:39,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10644 Valid, 4840 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:28:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9806 states. [2025-03-16 20:28:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9806 to 8558. [2025-03-16 20:28:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8556 states have (on average 1.3789153810191679) internal successors, (11798), 8557 states have internal predecessors, (11798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 11798 transitions. [2025-03-16 20:28:39,451 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 11798 transitions. Word has length 85 [2025-03-16 20:28:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:39,451 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 11798 transitions. [2025-03-16 20:28:39,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.476190476190476) internal successors, (199), 20 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 11798 transitions. [2025-03-16 20:28:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:28:39,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:39,452 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:39,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:28:39,652 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,SelfDestructingSolverStorable23 [2025-03-16 20:28:39,653 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:39,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash -398242185, now seen corresponding path program 1 times [2025-03-16 20:28:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:39,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793984636] [2025-03-16 20:28:39,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:39,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:39,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:39,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:39,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793984636] [2025-03-16 20:28:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793984636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091451259] [2025-03-16 20:28:39,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:39,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:39,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:28:39,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:39,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:39,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:39,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:39,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:28:39,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:40,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091451259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:40,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:40,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-16 20:28:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768746419] [2025-03-16 20:28:40,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:40,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 20:28:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:40,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 20:28:40,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:28:40,744 INFO L87 Difference]: Start difference. First operand 8558 states and 11798 transitions. Second operand has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 22 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:41,362 INFO L93 Difference]: Finished difference Result 21442 states and 28768 transitions. [2025-03-16 20:28:41,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:28:41,362 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 22 states have internal predecessors, (188), 0 states have call successors, (0), 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 85 [2025-03-16 20:28:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:41,376 INFO L225 Difference]: With dead ends: 21442 [2025-03-16 20:28:41,376 INFO L226 Difference]: Without dead ends: 15244 [2025-03-16 20:28:41,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 20:28:41,383 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 12211 mSDsluCounter, 4774 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12211 SdHoareTripleChecker+Valid, 6284 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:41,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12211 Valid, 6284 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:28:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15244 states. [2025-03-16 20:28:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15244 to 15080. [2025-03-16 20:28:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15080 states, 15078 states have (on average 1.337113675553787) internal successors, (20161), 15079 states have internal predecessors, (20161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 20161 transitions. [2025-03-16 20:28:41,747 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 20161 transitions. Word has length 85 [2025-03-16 20:28:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:41,747 INFO L471 AbstractCegarLoop]: Abstraction has 15080 states and 20161 transitions. [2025-03-16 20:28:41,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.173913043478262) internal successors, (188), 22 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 20161 transitions. [2025-03-16 20:28:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 20:28:41,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:41,748 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:41,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:28:41,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:41,949 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:41,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1428286409, now seen corresponding path program 1 times [2025-03-16 20:28:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:41,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835044443] [2025-03-16 20:28:41,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:41,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:41,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:41,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:41,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835044443] [2025-03-16 20:28:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835044443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827922281] [2025-03-16 20:28:42,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:42,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:42,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:42,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:42,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:28:42,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 20:28:42,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 20:28:42,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:42,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:42,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:28:42,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:43,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827922281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:44,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 33 [2025-03-16 20:28:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591677738] [2025-03-16 20:28:44,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:44,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 20:28:44,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:44,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 20:28:44,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 20:28:44,237 INFO L87 Difference]: Start difference. First operand 15080 states and 20161 transitions. Second operand has 33 states, 33 states have (on average 6.757575757575758) internal successors, (223), 33 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-16 20:28:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:28:49,883 INFO L93 Difference]: Finished difference Result 91200 states and 119190 transitions. [2025-03-16 20:28:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-16 20:28:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.757575757575758) internal successors, (223), 33 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 85 [2025-03-16 20:28:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:28:49,959 INFO L225 Difference]: With dead ends: 91200 [2025-03-16 20:28:49,960 INFO L226 Difference]: Without dead ends: 78492 [2025-03-16 20:28:49,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2503 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1823, Invalid=7107, Unknown=0, NotChecked=0, Total=8930 [2025-03-16 20:28:49,974 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 23792 mSDsluCounter, 10238 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23792 SdHoareTripleChecker+Valid, 11783 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:28:49,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23792 Valid, 11783 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:28:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78492 states. [2025-03-16 20:28:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78492 to 77752. [2025-03-16 20:28:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77752 states, 77750 states have (on average 1.2881800643086816) internal successors, (100156), 77751 states have internal predecessors, (100156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:28:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77752 states to 77752 states and 100156 transitions. [2025-03-16 20:28:52,651 INFO L78 Accepts]: Start accepts. Automaton has 77752 states and 100156 transitions. Word has length 85 [2025-03-16 20:28:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:28:52,651 INFO L471 AbstractCegarLoop]: Abstraction has 77752 states and 100156 transitions. [2025-03-16 20:28:52,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.757575757575758) internal successors, (223), 33 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-16 20:28:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 77752 states and 100156 transitions. [2025-03-16 20:28:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:28:52,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:28:52,654 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:28:52,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:28:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 20:28:52,855 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:28:52,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:28:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash -269138191, now seen corresponding path program 1 times [2025-03-16 20:28:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:28:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396581597] [2025-03-16 20:28:52,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:28:52,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:28:52,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:28:52,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:52,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:28:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396581597] [2025-03-16 20:28:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396581597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:28:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689234021] [2025-03-16 20:28:53,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:28:53,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:28:53,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:28:53,168 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:28:53,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:28:53,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:28:53,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:28:53,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:28:53,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:28:53,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-16 20:28:53,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:28:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:55,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:28:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:28:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689234021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:28:58,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:28:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21, 21] total 46 [2025-03-16 20:28:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110275291] [2025-03-16 20:28:58,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:28:58,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-16 20:28:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:28:58,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-16 20:28:58,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:28:58,130 INFO L87 Difference]: Start difference. First operand 77752 states and 100156 transitions. Second operand has 47 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 46 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-16 20:29:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:29:13,803 INFO L93 Difference]: Finished difference Result 320872 states and 413582 transitions. [2025-03-16 20:29:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-16 20:29:13,803 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 46 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 87 [2025-03-16 20:29:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:29:14,071 INFO L225 Difference]: With dead ends: 320872 [2025-03-16 20:29:14,071 INFO L226 Difference]: Without dead ends: 248314 [2025-03-16 20:29:14,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6625 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4071, Invalid=16235, Unknown=0, NotChecked=0, Total=20306 [2025-03-16 20:29:14,121 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 18025 mSDsluCounter, 13332 mSDsCounter, 0 mSdLazyCounter, 2666 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18025 SdHoareTripleChecker+Valid, 14878 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 20:29:14,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18025 Valid, 14878 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2666 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 20:29:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248314 states. [2025-03-16 20:29:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248314 to 153922. [2025-03-16 20:29:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153922 states, 153920 states have (on average 1.270289760914761) internal successors, (195523), 153921 states have internal predecessors, (195523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:29:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153922 states to 153922 states and 195523 transitions. [2025-03-16 20:29:21,198 INFO L78 Accepts]: Start accepts. Automaton has 153922 states and 195523 transitions. Word has length 87 [2025-03-16 20:29:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:29:21,198 INFO L471 AbstractCegarLoop]: Abstraction has 153922 states and 195523 transitions. [2025-03-16 20:29:21,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 46 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-16 20:29:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 153922 states and 195523 transitions. [2025-03-16 20:29:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:29:21,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:29:21,200 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:29:21,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:29:21,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 20:29:21,400 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:29:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:29:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1191748019, now seen corresponding path program 1 times [2025-03-16 20:29:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:29:21,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556848162] [2025-03-16 20:29:21,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:29:21,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:29:21,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:29:21,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:21,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:29:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556848162] [2025-03-16 20:29:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556848162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:29:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753553488] [2025-03-16 20:29:21,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:29:21,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:29:21,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:29:21,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:29:21,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:29:22,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:29:22,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:29:22,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:29:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:29:22,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 20:29:22,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:29:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:23,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:29:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:29:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753553488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:29:24,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:29:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 15] total 39 [2025-03-16 20:29:24,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130870079] [2025-03-16 20:29:24,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:29:24,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 20:29:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:29:24,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 20:29:24,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 20:29:24,208 INFO L87 Difference]: Start difference. First operand 153922 states and 195523 transitions. Second operand has 39 states, 39 states have (on average 6.17948717948718) internal successors, (241), 39 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)