./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.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.6.ufo.BOUNDED-12.pals+Problem12_label04.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 e1f94066d185a25351cbcea30e35499f745a051fde3e7dea5a9b71a49a6a37f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:31:03,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:31:04,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:31:04,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:31:04,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:31:04,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:31:04,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:31:04,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:31:04,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:31:04,071 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:31:04,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:31:04,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:31:04,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:31:04,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:31:04,072 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:31:04,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:31:04,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:31:04,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:31:04,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:31:04,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:31:04,075 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 -> e1f94066d185a25351cbcea30e35499f745a051fde3e7dea5a9b71a49a6a37f3 [2025-03-16 20:31:04,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:31:04,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:31:04,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:31:04,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:31:04,302 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:31:04,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.c [2025-03-16 20:31:05,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe76a1c4d/7665b8221b2643e2ac4fb87a9f1c87a2/FLAGa79de0d5b [2025-03-16 20:31:05,926 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:31:05,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.c [2025-03-16 20:31:05,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe76a1c4d/7665b8221b2643e2ac4fb87a9f1c87a2/FLAGa79de0d5b [2025-03-16 20:31:05,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe76a1c4d/7665b8221b2643e2ac4fb87a9f1c87a2 [2025-03-16 20:31:05,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:31:05,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:31:05,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:31:05,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:31:05,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:31:05,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:31:05" (1/1) ... [2025-03-16 20:31:05,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59059334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:05, skipping insertion in model container [2025-03-16 20:31:05,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:31:05" (1/1) ... [2025-03-16 20:31:06,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:31:06,385 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.6.ufo.BOUNDED-12.pals+Problem12_label04.c[15482,15495] [2025-03-16 20:31:06,442 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.6.ufo.BOUNDED-12.pals+Problem12_label04.c[22543,22556] [2025-03-16 20:31:06,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:31:06,909 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:31:06,938 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.6.ufo.BOUNDED-12.pals+Problem12_label04.c[15482,15495] [2025-03-16 20:31:06,945 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.6.ufo.BOUNDED-12.pals+Problem12_label04.c[22543,22556] [2025-03-16 20:31:07,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:31:07,218 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:31:07,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07 WrapperNode [2025-03-16 20:31:07,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:31:07,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:31:07,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:31:07,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:31:07,227 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:31:07" (1/1) ... [2025-03-16 20:31:07,279 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:31:07" (1/1) ... [2025-03-16 20:31:07,542 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5153 [2025-03-16 20:31:07,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:31:07,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:31:07,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:31:07,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:31:07,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,702 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:31:07,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:31:07,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:31:07,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:31:07,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:31:07,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (1/1) ... [2025-03-16 20:31:07,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:31:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:07,946 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:31:07,953 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:31:07,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:31:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:31:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:31:07,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:31:08,047 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:31:08,048 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:31:11,470 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3683: havoc calculate_output2_#t~ret43#1; [2025-03-16 20:31:11,471 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173: havoc calculate_output3_#t~ret44#1; [2025-03-16 20:31:11,472 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2204: havoc calculate_output_#t~ret42#1; [2025-03-16 20:31:11,647 INFO L? ?]: Removed 746 outVars from TransFormulas that were not future-live. [2025-03-16 20:31:11,648 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:31:11,675 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:31:11,679 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:31:11,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:31:11 BoogieIcfgContainer [2025-03-16 20:31:11,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:31:11,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:31:11,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:31:11,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:31:11,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:31:05" (1/3) ... [2025-03-16 20:31:11,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e852a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:31:11, skipping insertion in model container [2025-03-16 20:31:11,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:31:07" (2/3) ... [2025-03-16 20:31:11,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e852a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:31:11, skipping insertion in model container [2025-03-16 20:31:11,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:31:11" (3/3) ... [2025-03-16 20:31:11,690 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.c [2025-03-16 20:31:11,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:31:11,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label04.c that has 1 procedures, 849 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:31:11,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:31:11,794 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;@69e7443, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:31:11,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:31:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 849 states, 846 states have (on average 1.9716312056737588) internal successors, (1668), 848 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states 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:31:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:31:11,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:11,808 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] [2025-03-16 20:31:11,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:11,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1545405242, now seen corresponding path program 1 times [2025-03-16 20:31:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717861285] [2025-03-16 20:31:11,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:11,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:31:11,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:31:11,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:11,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:12,027 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:31:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717861285] [2025-03-16 20:31:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717861285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:12,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:31:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205568234] [2025-03-16 20:31:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:12,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:31:12,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:12,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:31:12,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:31:12,052 INFO L87 Difference]: Start difference. First operand has 849 states, 846 states have (on average 1.9716312056737588) internal successors, (1668), 848 states have internal predecessors, (1668), 0 states have call successors, (0), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:31:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:12,109 INFO L93 Difference]: Finished difference Result 1654 states and 3250 transitions. [2025-03-16 20:31:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:31:12,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:31:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:12,127 INFO L225 Difference]: With dead ends: 1654 [2025-03-16 20:31:12,128 INFO L226 Difference]: Without dead ends: 845 [2025-03-16 20:31:12,132 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:31:12,134 INFO L435 NwaCegarLoop]: 1604 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, 1604 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:31:12,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-16 20:31:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-16 20:31:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.896797153024911) internal successors, (1599), 844 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states 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:31:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1599 transitions. [2025-03-16 20:31:12,208 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1599 transitions. Word has length 23 [2025-03-16 20:31:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:12,208 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1599 transitions. [2025-03-16 20:31:12,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:31:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1599 transitions. [2025-03-16 20:31:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:31:12,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:12,209 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] [2025-03-16 20:31:12,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:31:12,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash 700933371, now seen corresponding path program 1 times [2025-03-16 20:31:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884949377] [2025-03-16 20:31:12,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:31:12,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:31:12,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:12,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:12,412 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:31:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884949377] [2025-03-16 20:31:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884949377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:31:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885991117] [2025-03-16 20:31:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:12,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:31:12,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:12,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:31:12,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:31:12,414 INFO L87 Difference]: Start difference. First operand 845 states and 1599 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:31:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:12,497 INFO L93 Difference]: Finished difference Result 895 states and 1678 transitions. [2025-03-16 20:31:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:31:12,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:31:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:12,503 INFO L225 Difference]: With dead ends: 895 [2025-03-16 20:31:12,503 INFO L226 Difference]: Without dead ends: 845 [2025-03-16 20:31:12,503 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:31:12,504 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 0 mSDsluCounter, 3152 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:12,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4750 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-16 20:31:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-16 20:31:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.849347568208778) internal successors, (1559), 844 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states 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:31:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1559 transitions. [2025-03-16 20:31:12,522 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1559 transitions. Word has length 23 [2025-03-16 20:31:12,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:12,522 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1559 transitions. [2025-03-16 20:31:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:31:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1559 transitions. [2025-03-16 20:31:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:31:12,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:12,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:12,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:31:12,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2120902216, now seen corresponding path program 1 times [2025-03-16 20:31:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:12,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287691677] [2025-03-16 20:31:12,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:12,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:12,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:31:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:31:12,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:12,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:12,689 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:31:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287691677] [2025-03-16 20:31:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287691677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:31:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022183315] [2025-03-16 20:31:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:12,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:12,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:12,691 INFO L87 Difference]: Start difference. First operand 845 states and 1559 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:31:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:15,401 INFO L93 Difference]: Finished difference Result 2349 states and 4432 transitions. [2025-03-16 20:31:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:15,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-16 20:31:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:15,409 INFO L225 Difference]: With dead ends: 2349 [2025-03-16 20:31:15,410 INFO L226 Difference]: Without dead ends: 1596 [2025-03-16 20:31:15,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:15,414 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 861 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:15,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 595 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 20:31:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-03-16 20:31:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2025-03-16 20:31:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1594 states have (on average 1.5922208281053953) internal successors, (2538), 1595 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states 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:31:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2538 transitions. [2025-03-16 20:31:15,449 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2538 transitions. Word has length 60 [2025-03-16 20:31:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2538 transitions. [2025-03-16 20:31:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:31:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2538 transitions. [2025-03-16 20:31:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:31:15,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:15,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:15,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:31:15,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:15,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:15,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1828731592, now seen corresponding path program 1 times [2025-03-16 20:31:15,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:15,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51182731] [2025-03-16 20:31:15,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:15,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:31:15,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:31:15,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:15,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:15,653 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:31:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51182731] [2025-03-16 20:31:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51182731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584537475] [2025-03-16 20:31:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:15,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:15,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:15,655 INFO L87 Difference]: Start difference. First operand 1596 states and 2538 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:31:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:15,903 INFO L93 Difference]: Finished difference Result 2160 states and 3450 transitions. [2025-03-16 20:31:15,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:31:15,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 20:31:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:15,910 INFO L225 Difference]: With dead ends: 2160 [2025-03-16 20:31:15,911 INFO L226 Difference]: Without dead ends: 2113 [2025-03-16 20:31:15,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:31:15,912 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 9674 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9674 SdHoareTripleChecker+Valid, 3778 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:15,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9674 Valid, 3778 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2025-03-16 20:31:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1641. [2025-03-16 20:31:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1639 states have (on average 1.5930445393532642) internal successors, (2611), 1640 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states 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:31:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2611 transitions. [2025-03-16 20:31:15,946 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2611 transitions. Word has length 62 [2025-03-16 20:31:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:15,946 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2611 transitions. [2025-03-16 20:31:15,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:31:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2611 transitions. [2025-03-16 20:31:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:31:15,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:15,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:15,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:31:15,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:15,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash -732253638, now seen corresponding path program 1 times [2025-03-16 20:31:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:15,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110515749] [2025-03-16 20:31:15,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:15,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:31:15,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:31:15,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:15,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:16,283 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:31:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110515749] [2025-03-16 20:31:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110515749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:16,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:16,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153407977] [2025-03-16 20:31:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:16,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:16,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:16,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:16,286 INFO L87 Difference]: Start difference. First operand 1641 states and 2611 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:31:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:16,481 INFO L93 Difference]: Finished difference Result 1735 states and 2761 transitions. [2025-03-16 20:31:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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 64 [2025-03-16 20:31:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:16,486 INFO L225 Difference]: With dead ends: 1735 [2025-03-16 20:31:16,487 INFO L226 Difference]: Without dead ends: 1643 [2025-03-16 20:31:16,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:31:16,488 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 1530 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:16,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1992 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-16 20:31:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1641. [2025-03-16 20:31:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1639 states have (on average 1.5924344112263575) internal successors, (2610), 1640 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states 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:31:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2610 transitions. [2025-03-16 20:31:16,512 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2610 transitions. Word has length 64 [2025-03-16 20:31:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:16,512 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2610 transitions. [2025-03-16 20:31:16,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:31:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2610 transitions. [2025-03-16 20:31:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:31:16,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:16,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:16,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:31:16,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:16,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash -733296323, now seen corresponding path program 1 times [2025-03-16 20:31:16,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:16,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882883642] [2025-03-16 20:31:16,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:16,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:16,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:31:16,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:31:16,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:16,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:16,573 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:31:16,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:16,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882883642] [2025-03-16 20:31:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882883642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:16,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193332096] [2025-03-16 20:31:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:16,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:16,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:16,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:16,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:16,574 INFO L87 Difference]: Start difference. First operand 1641 states and 2610 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:31:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:16,598 INFO L93 Difference]: Finished difference Result 1814 states and 2887 transitions. [2025-03-16 20:31:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:16,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 64 [2025-03-16 20:31:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:16,605 INFO L225 Difference]: With dead ends: 1814 [2025-03-16 20:31:16,605 INFO L226 Difference]: Without dead ends: 1722 [2025-03-16 20:31:16,606 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:31:16,607 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 1488 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:16,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1629 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-03-16 20:31:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2025-03-16 20:31:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.5919674039580909) internal successors, (2735), 1719 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states 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:31:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2735 transitions. [2025-03-16 20:31:16,643 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2735 transitions. Word has length 64 [2025-03-16 20:31:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:16,643 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2735 transitions. [2025-03-16 20:31:16,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:31:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2735 transitions. [2025-03-16 20:31:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:31:16,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:16,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:16,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:31:16,645 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:16,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1224041238, now seen corresponding path program 1 times [2025-03-16 20:31:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:16,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945254462] [2025-03-16 20:31:16,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:16,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:31:16,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:31:16,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:16,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:16,870 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:31:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945254462] [2025-03-16 20:31:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945254462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:16,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:31:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821493168] [2025-03-16 20:31:16,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:16,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:31:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:16,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:31:16,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:31:16,871 INFO L87 Difference]: Start difference. First operand 1720 states and 2735 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:31:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:16,909 INFO L93 Difference]: Finished difference Result 1726 states and 2742 transitions. [2025-03-16 20:31:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:31:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 20:31:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:16,915 INFO L225 Difference]: With dead ends: 1726 [2025-03-16 20:31:16,915 INFO L226 Difference]: Without dead ends: 1724 [2025-03-16 20:31:16,916 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:31:16,917 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 6209 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7764 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:31:16,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7764 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2025-03-16 20:31:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2025-03-16 20:31:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1722 states have (on average 1.5900116144018583) internal successors, (2738), 1723 states have internal predecessors, (2738), 0 states have call successors, (0), 0 states 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:31:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2738 transitions. [2025-03-16 20:31:16,946 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2738 transitions. Word has length 65 [2025-03-16 20:31:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:16,946 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 2738 transitions. [2025-03-16 20:31:16,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:31:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2738 transitions. [2025-03-16 20:31:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:16,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:16,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:16,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:31:16,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:16,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1959673116, now seen corresponding path program 1 times [2025-03-16 20:31:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:16,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121305520] [2025-03-16 20:31:16,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:16,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:16,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:16,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:16,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,005 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:31:17,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121305520] [2025-03-16 20:31:17,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121305520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:17,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087660841] [2025-03-16 20:31:17,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:17,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:17,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:17,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:17,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,007 INFO L87 Difference]: Start difference. First operand 1724 states and 2738 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:17,029 INFO L93 Difference]: Finished difference Result 1910 states and 3031 transitions. [2025-03-16 20:31:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 66 [2025-03-16 20:31:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:17,035 INFO L225 Difference]: With dead ends: 1910 [2025-03-16 20:31:17,035 INFO L226 Difference]: Without dead ends: 1814 [2025-03-16 20:31:17,035 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:31:17,036 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1504 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1697 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:31:17,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1697 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2025-03-16 20:31:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1812. [2025-03-16 20:31:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1810 states have (on average 1.5883977900552486) internal successors, (2875), 1811 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states 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:31:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2875 transitions. [2025-03-16 20:31:17,067 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2875 transitions. Word has length 66 [2025-03-16 20:31:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,067 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2875 transitions. [2025-03-16 20:31:17,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2875 transitions. [2025-03-16 20:31:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:17,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:17,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:31:17,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash 678830108, now seen corresponding path program 1 times [2025-03-16 20:31:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823114637] [2025-03-16 20:31:17,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:17,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:17,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:17,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,115 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:31:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823114637] [2025-03-16 20:31:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823114637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:17,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:17,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:17,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794459848] [2025-03-16 20:31:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:17,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:17,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,117 INFO L87 Difference]: Start difference. First operand 1812 states and 2875 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:17,138 INFO L93 Difference]: Finished difference Result 2310 states and 3655 transitions. [2025-03-16 20:31:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:17,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 66 [2025-03-16 20:31:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:17,145 INFO L225 Difference]: With dead ends: 2310 [2025-03-16 20:31:17,146 INFO L226 Difference]: Without dead ends: 2049 [2025-03-16 20:31:17,147 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:31:17,149 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1502 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1703 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:31:17,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2025-03-16 20:31:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2047. [2025-03-16 20:31:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2045 states have (on average 1.5828850855745722) internal successors, (3237), 2046 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states 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:31:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 3237 transitions. [2025-03-16 20:31:17,191 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 3237 transitions. Word has length 66 [2025-03-16 20:31:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,191 INFO L471 AbstractCegarLoop]: Abstraction has 2047 states and 3237 transitions. [2025-03-16 20:31:17,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 3237 transitions. [2025-03-16 20:31:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:17,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:17,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:31:17,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1522189084, now seen corresponding path program 1 times [2025-03-16 20:31:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832619471] [2025-03-16 20:31:17,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:17,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:17,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:17,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,245 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:31:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832619471] [2025-03-16 20:31:17,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832619471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:17,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:17,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:17,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746543646] [2025-03-16 20:31:17,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:17,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:17,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:17,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:17,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,246 INFO L87 Difference]: Start difference. First operand 2047 states and 3237 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:17,272 INFO L93 Difference]: Finished difference Result 2991 states and 4699 transitions. [2025-03-16 20:31:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:17,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 66 [2025-03-16 20:31:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:17,279 INFO L225 Difference]: With dead ends: 2991 [2025-03-16 20:31:17,279 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 20:31:17,281 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:31:17,281 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1500 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1705 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:31:17,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1705 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 20:31:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2493. [2025-03-16 20:31:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2491 states have (on average 1.5708550782818145) internal successors, (3913), 2492 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states 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:31:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3913 transitions. [2025-03-16 20:31:17,322 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3913 transitions. Word has length 66 [2025-03-16 20:31:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,323 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 3913 transitions. [2025-03-16 20:31:17,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3913 transitions. [2025-03-16 20:31:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:17,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:17,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:31:17,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2015737572, now seen corresponding path program 1 times [2025-03-16 20:31:17,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910619447] [2025-03-16 20:31:17,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:17,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:17,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:17,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,400 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:31:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910619447] [2025-03-16 20:31:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910619447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790515822] [2025-03-16 20:31:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:17,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:17,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:17,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,401 INFO L87 Difference]: Start difference. First operand 2493 states and 3913 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:17,434 INFO L93 Difference]: Finished difference Result 4281 states and 6643 transitions. [2025-03-16 20:31:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 66 [2025-03-16 20:31:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:17,444 INFO L225 Difference]: With dead ends: 4281 [2025-03-16 20:31:17,444 INFO L226 Difference]: Without dead ends: 3339 [2025-03-16 20:31:17,446 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:31:17,446 INFO L435 NwaCegarLoop]: 1608 mSDtfsCounter, 1496 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1701 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:31:17,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1701 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2025-03-16 20:31:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2025-03-16 20:31:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3335 states have (on average 1.5499250374812594) internal successors, (5169), 3336 states have internal predecessors, (5169), 0 states have call successors, (0), 0 states 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:31:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5169 transitions. [2025-03-16 20:31:17,509 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5169 transitions. Word has length 66 [2025-03-16 20:31:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,509 INFO L471 AbstractCegarLoop]: Abstraction has 3337 states and 5169 transitions. [2025-03-16 20:31:17,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5169 transitions. [2025-03-16 20:31:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:17,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:17,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:31:17,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1729440796, now seen corresponding path program 1 times [2025-03-16 20:31:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949309445] [2025-03-16 20:31:17,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:17,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:17,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,553 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:31:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949309445] [2025-03-16 20:31:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949309445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:17,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313197549] [2025-03-16 20:31:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:17,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:17,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:17,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,554 INFO L87 Difference]: Start difference. First operand 3337 states and 5169 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:17,601 INFO L93 Difference]: Finished difference Result 6717 states and 10243 transitions. [2025-03-16 20:31:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:17,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 66 [2025-03-16 20:31:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:17,614 INFO L225 Difference]: With dead ends: 6717 [2025-03-16 20:31:17,614 INFO L226 Difference]: Without dead ends: 4931 [2025-03-16 20:31:17,617 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:31:17,618 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1494 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1703 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:31:17,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2025-03-16 20:31:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4929. [2025-03-16 20:31:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4929 states, 4927 states have (on average 1.519991881469454) internal successors, (7489), 4928 states have internal predecessors, (7489), 0 states have call successors, (0), 0 states 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:31:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 7489 transitions. [2025-03-16 20:31:17,708 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 7489 transitions. Word has length 66 [2025-03-16 20:31:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,708 INFO L471 AbstractCegarLoop]: Abstraction has 4929 states and 7489 transitions. [2025-03-16 20:31:17,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 7489 transitions. [2025-03-16 20:31:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:31:17,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:17,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:31:17,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1949555172, now seen corresponding path program 1 times [2025-03-16 20:31:17,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953492388] [2025-03-16 20:31:17,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:17,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:31:17,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:31:17,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,753 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:31:17,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953492388] [2025-03-16 20:31:17,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953492388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:17,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:17,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353793252] [2025-03-16 20:31:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:17,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:17,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:17,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:17,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,754 INFO L87 Difference]: Start difference. First operand 4929 states and 7489 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:17,829 INFO L93 Difference]: Finished difference Result 11301 states and 16867 transitions. [2025-03-16 20:31:17,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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 66 [2025-03-16 20:31:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:17,844 INFO L225 Difference]: With dead ends: 11301 [2025-03-16 20:31:17,844 INFO L226 Difference]: Without dead ends: 7923 [2025-03-16 20:31:17,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:17,851 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1498 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1707 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:31:17,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7923 states. [2025-03-16 20:31:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7923 to 7921. [2025-03-16 20:31:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 7919 states have (on average 1.4831418108347014) internal successors, (11745), 7920 states have internal predecessors, (11745), 0 states have call successors, (0), 0 states 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:31:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 11745 transitions. [2025-03-16 20:31:17,994 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 11745 transitions. Word has length 66 [2025-03-16 20:31:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,995 INFO L471 AbstractCegarLoop]: Abstraction has 7921 states and 11745 transitions. [2025-03-16 20:31:17,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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:31:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 11745 transitions. [2025-03-16 20:31:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:17,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:17,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:31:17,997 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 264641035, now seen corresponding path program 1 times [2025-03-16 20:31:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048700713] [2025-03-16 20:31:17,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:18,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:18,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:18,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:18,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:31:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:18,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048700713] [2025-03-16 20:31:18,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048700713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:18,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:18,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:18,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532216652] [2025-03-16 20:31:18,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:18,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:18,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:18,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:18,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:18,183 INFO L87 Difference]: Start difference. First operand 7921 states and 11745 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:31:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:18,707 INFO L93 Difference]: Finished difference Result 45567 states and 66568 transitions. [2025-03-16 20:31:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:18,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 86 [2025-03-16 20:31:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:18,873 INFO L225 Difference]: With dead ends: 45567 [2025-03-16 20:31:18,873 INFO L226 Difference]: Without dead ends: 41085 [2025-03-16 20:31:18,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:18,882 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 8065 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8065 SdHoareTripleChecker+Valid, 4056 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:18,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8065 Valid, 4056 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41085 states. [2025-03-16 20:31:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41085 to 13361. [2025-03-16 20:31:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13361 states, 13359 states have (on average 1.4660528482670858) internal successors, (19585), 13360 states have internal predecessors, (19585), 0 states have call successors, (0), 0 states 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:31:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13361 states to 13361 states and 19585 transitions. [2025-03-16 20:31:19,356 INFO L78 Accepts]: Start accepts. Automaton has 13361 states and 19585 transitions. Word has length 86 [2025-03-16 20:31:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:19,356 INFO L471 AbstractCegarLoop]: Abstraction has 13361 states and 19585 transitions. [2025-03-16 20:31:19,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:31:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13361 states and 19585 transitions. [2025-03-16 20:31:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:19,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:19,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:19,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:31:19,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:19,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1016201973, now seen corresponding path program 1 times [2025-03-16 20:31:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793576591] [2025-03-16 20:31:19,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:19,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:19,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:19,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:19,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:31:19,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:19,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793576591] [2025-03-16 20:31:19,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793576591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:19,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317208091] [2025-03-16 20:31:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:19,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:19,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:19,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:19,497 INFO L87 Difference]: Start difference. First operand 13361 states and 19585 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:31:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:20,087 INFO L93 Difference]: Finished difference Result 51935 states and 75784 transitions. [2025-03-16 20:31:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 86 [2025-03-16 20:31:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:20,164 INFO L225 Difference]: With dead ends: 51935 [2025-03-16 20:31:20,164 INFO L226 Difference]: Without dead ends: 45565 [2025-03-16 20:31:20,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:20,183 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8069 mSDsluCounter, 2367 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8069 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:20,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8069 Valid, 3998 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45565 states. [2025-03-16 20:31:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45565 to 21969. [2025-03-16 20:31:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21969 states, 21967 states have (on average 1.4553193426503392) internal successors, (31969), 21968 states have internal predecessors, (31969), 0 states have call successors, (0), 0 states 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:31:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21969 states to 21969 states and 31969 transitions. [2025-03-16 20:31:20,754 INFO L78 Accepts]: Start accepts. Automaton has 21969 states and 31969 transitions. Word has length 86 [2025-03-16 20:31:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:20,754 INFO L471 AbstractCegarLoop]: Abstraction has 21969 states and 31969 transitions. [2025-03-16 20:31:20,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:31:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21969 states and 31969 transitions. [2025-03-16 20:31:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:20,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:20,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:31:20,758 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:20,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -172842997, now seen corresponding path program 1 times [2025-03-16 20:31:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:20,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76393700] [2025-03-16 20:31:20,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:20,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:20,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:20,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:20,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:31:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76393700] [2025-03-16 20:31:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76393700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214294347] [2025-03-16 20:31:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:20,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:20,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:20,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:20,923 INFO L87 Difference]: Start difference. First operand 21969 states and 31969 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:31:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:21,735 INFO L93 Difference]: Finished difference Result 58303 states and 84968 transitions. [2025-03-16 20:31:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 86 [2025-03-16 20:31:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:21,806 INFO L225 Difference]: With dead ends: 58303 [2025-03-16 20:31:21,807 INFO L226 Difference]: Without dead ends: 51933 [2025-03-16 20:31:21,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:21,822 INFO L435 NwaCegarLoop]: 1629 mSDtfsCounter, 8107 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8107 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:21,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8107 Valid, 3951 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51933 states. [2025-03-16 20:31:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51933 to 28337. [2025-03-16 20:31:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28337 states, 28335 states have (on average 1.4523733898006) internal successors, (41153), 28336 states have internal predecessors, (41153), 0 states have call successors, (0), 0 states 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:31:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28337 states to 28337 states and 41153 transitions. [2025-03-16 20:31:22,829 INFO L78 Accepts]: Start accepts. Automaton has 28337 states and 41153 transitions. Word has length 86 [2025-03-16 20:31:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:22,829 INFO L471 AbstractCegarLoop]: Abstraction has 28337 states and 41153 transitions. [2025-03-16 20:31:22,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:31:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28337 states and 41153 transitions. [2025-03-16 20:31:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:22,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:22,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:22,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:31:22,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:22,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash 584197643, now seen corresponding path program 1 times [2025-03-16 20:31:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280169007] [2025-03-16 20:31:22,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:22,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:22,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:22,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:22,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:31:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:23,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280169007] [2025-03-16 20:31:23,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280169007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:23,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:23,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157609671] [2025-03-16 20:31:23,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:23,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:23,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:23,012 INFO L87 Difference]: Start difference. First operand 28337 states and 41153 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:31:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:23,956 INFO L93 Difference]: Finished difference Result 64671 states and 94152 transitions. [2025-03-16 20:31:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:23,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 86 [2025-03-16 20:31:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:24,042 INFO L225 Difference]: With dead ends: 64671 [2025-03-16 20:31:24,042 INFO L226 Difference]: Without dead ends: 58301 [2025-03-16 20:31:24,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:24,065 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 8172 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8172 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:24,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8172 Valid, 3973 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58301 states. [2025-03-16 20:31:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58301 to 34705. [2025-03-16 20:31:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34705 states, 34703 states have (on average 1.4505086015618247) internal successors, (50337), 34704 states have internal predecessors, (50337), 0 states have call successors, (0), 0 states 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:31:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34705 states to 34705 states and 50337 transitions. [2025-03-16 20:31:24,947 INFO L78 Accepts]: Start accepts. Automaton has 34705 states and 50337 transitions. Word has length 86 [2025-03-16 20:31:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:24,947 INFO L471 AbstractCegarLoop]: Abstraction has 34705 states and 50337 transitions. [2025-03-16 20:31:24,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:31:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 34705 states and 50337 transitions. [2025-03-16 20:31:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:24,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:24,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:24,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:31:24,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:24,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash 34408715, now seen corresponding path program 1 times [2025-03-16 20:31:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:24,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262285801] [2025-03-16 20:31:24,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:24,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:24,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:24,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:24,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:31:25,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:25,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262285801] [2025-03-16 20:31:25,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262285801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:25,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:25,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528277401] [2025-03-16 20:31:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:25,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:25,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:25,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:25,075 INFO L87 Difference]: Start difference. First operand 34705 states and 50337 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:31:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:26,072 INFO L93 Difference]: Finished difference Result 71039 states and 103336 transitions. [2025-03-16 20:31:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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 86 [2025-03-16 20:31:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:26,152 INFO L225 Difference]: With dead ends: 71039 [2025-03-16 20:31:26,153 INFO L226 Difference]: Without dead ends: 64669 [2025-03-16 20:31:26,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:26,173 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 8092 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8092 SdHoareTripleChecker+Valid, 4012 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:26,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8092 Valid, 4012 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2025-03-16 20:31:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 41073. [2025-03-16 20:31:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41073 states, 41071 states have (on average 1.4492220788390835) internal successors, (59521), 41072 states have internal predecessors, (59521), 0 states have call successors, (0), 0 states 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:31:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41073 states to 41073 states and 59521 transitions. [2025-03-16 20:31:27,322 INFO L78 Accepts]: Start accepts. Automaton has 41073 states and 59521 transitions. Word has length 86 [2025-03-16 20:31:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 41073 states and 59521 transitions. [2025-03-16 20:31:27,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:31:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 41073 states and 59521 transitions. [2025-03-16 20:31:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:27,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:27,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:27,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:31:27,326 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:27,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash 650380043, now seen corresponding path program 1 times [2025-03-16 20:31:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:27,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180210881] [2025-03-16 20:31:27,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:27,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:27,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:27,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:27,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:31:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180210881] [2025-03-16 20:31:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180210881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:27,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344044402] [2025-03-16 20:31:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:27,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:27,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:27,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:27,475 INFO L87 Difference]: Start difference. First operand 41073 states and 59521 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:31:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:28,865 INFO L93 Difference]: Finished difference Result 77407 states and 112520 transitions. [2025-03-16 20:31:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:28,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 86 [2025-03-16 20:31:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:28,956 INFO L225 Difference]: With dead ends: 77407 [2025-03-16 20:31:28,957 INFO L226 Difference]: Without dead ends: 71037 [2025-03-16 20:31:28,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:28,983 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 8018 mSDsluCounter, 2485 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8018 SdHoareTripleChecker+Valid, 4111 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:28,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8018 Valid, 4111 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71037 states. [2025-03-16 20:31:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71037 to 47441. [2025-03-16 20:31:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47441 states, 47439 states have (on average 1.448280950272982) internal successors, (68705), 47440 states have internal predecessors, (68705), 0 states have call successors, (0), 0 states 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:31:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47441 states to 47441 states and 68705 transitions. [2025-03-16 20:31:30,624 INFO L78 Accepts]: Start accepts. Automaton has 47441 states and 68705 transitions. Word has length 86 [2025-03-16 20:31:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:30,624 INFO L471 AbstractCegarLoop]: Abstraction has 47441 states and 68705 transitions. [2025-03-16 20:31:30,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:31:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 47441 states and 68705 transitions. [2025-03-16 20:31:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:31:30,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:30,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:30,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:31:30,628 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1701650639, now seen corresponding path program 1 times [2025-03-16 20:31:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332828480] [2025-03-16 20:31:30,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:30,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:31:30,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:31:30,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:30,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:30,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:30,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332828480] [2025-03-16 20:31:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332828480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:30,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:30,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736003611] [2025-03-16 20:31:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:30,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:30,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:30,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:30,691 INFO L87 Difference]: Start difference. First operand 47441 states and 68705 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:31:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:31,466 INFO L93 Difference]: Finished difference Result 93333 states and 134947 transitions. [2025-03-16 20:31:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:31,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:31:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:31,521 INFO L225 Difference]: With dead ends: 93333 [2025-03-16 20:31:31,521 INFO L226 Difference]: Without dead ends: 47443 [2025-03-16 20:31:31,547 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:31:31,547 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 53 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 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:31:31,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47443 states. [2025-03-16 20:31:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47443 to 47441. [2025-03-16 20:31:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47441 states, 47439 states have (on average 1.4337781150530156) internal successors, (68017), 47440 states have internal predecessors, (68017), 0 states have call successors, (0), 0 states 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:31:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47441 states to 47441 states and 68017 transitions. [2025-03-16 20:31:32,704 INFO L78 Accepts]: Start accepts. Automaton has 47441 states and 68017 transitions. Word has length 87 [2025-03-16 20:31:32,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:32,704 INFO L471 AbstractCegarLoop]: Abstraction has 47441 states and 68017 transitions. [2025-03-16 20:31:32,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:31:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 47441 states and 68017 transitions. [2025-03-16 20:31:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:31:32,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:32,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:32,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:31:32,707 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:32,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1575337651, now seen corresponding path program 1 times [2025-03-16 20:31:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706705453] [2025-03-16 20:31:32,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:32,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:31:32,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:31:32,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:32,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706705453] [2025-03-16 20:31:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706705453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300433434] [2025-03-16 20:31:32,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:32,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:32,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:32,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:32,793 INFO L87 Difference]: Start difference. First operand 47441 states and 68017 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:33,271 INFO L93 Difference]: Finished difference Result 64265 states and 92280 transitions. [2025-03-16 20:31:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 20:31:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:33,293 INFO L225 Difference]: With dead ends: 64265 [2025-03-16 20:31:33,293 INFO L226 Difference]: Without dead ends: 18375 [2025-03-16 20:31:33,321 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:31:33,322 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 47 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3145 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:31:33,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3145 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18375 states. [2025-03-16 20:31:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18375 to 18368. [2025-03-16 20:31:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18368 states, 18366 states have (on average 1.4417946204943919) internal successors, (26480), 18367 states have internal predecessors, (26480), 0 states have call successors, (0), 0 states 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:31:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18368 states to 18368 states and 26480 transitions. [2025-03-16 20:31:33,852 INFO L78 Accepts]: Start accepts. Automaton has 18368 states and 26480 transitions. Word has length 88 [2025-03-16 20:31:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:33,852 INFO L471 AbstractCegarLoop]: Abstraction has 18368 states and 26480 transitions. [2025-03-16 20:31:33,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18368 states and 26480 transitions. [2025-03-16 20:31:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:31:33,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:33,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:33,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:31:33,854 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:33,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:33,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1115437610, now seen corresponding path program 1 times [2025-03-16 20:31:33,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:33,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450027831] [2025-03-16 20:31:33,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:33,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:33,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:31:33,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:31:33,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:33,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:33,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450027831] [2025-03-16 20:31:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450027831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:33,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:33,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:33,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230596869] [2025-03-16 20:31:33,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:33,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:33,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:33,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:33,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:33,910 INFO L87 Difference]: Start difference. First operand 18368 states and 26480 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:31:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:34,056 INFO L93 Difference]: Finished difference Result 26772 states and 38482 transitions. [2025-03-16 20:31:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:34,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:31:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:34,067 INFO L225 Difference]: With dead ends: 26772 [2025-03-16 20:31:34,067 INFO L226 Difference]: Without dead ends: 9970 [2025-03-16 20:31:34,076 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:31:34,077 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 49 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3124 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:31:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3124 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2025-03-16 20:31:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2025-03-16 20:31:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9966 states have (on average 1.4408990567930966) internal successors, (14360), 9967 states have internal predecessors, (14360), 0 states have call successors, (0), 0 states 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:31:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14360 transitions. [2025-03-16 20:31:34,273 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14360 transitions. Word has length 89 [2025-03-16 20:31:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:34,273 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 14360 transitions. [2025-03-16 20:31:34,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:31:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14360 transitions. [2025-03-16 20:31:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:31:34,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:34,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:34,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:31:34,275 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:34,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1650890717, now seen corresponding path program 1 times [2025-03-16 20:31:34,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:34,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387049410] [2025-03-16 20:31:34,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:34,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:31:34,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:31:34,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:34,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387049410] [2025-03-16 20:31:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387049410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:34,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:34,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751280434] [2025-03-16 20:31:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:34,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:34,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:34,360 INFO L87 Difference]: Start difference. First operand 9968 states and 14360 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:31:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:34,485 INFO L93 Difference]: Finished difference Result 14172 states and 20302 transitions. [2025-03-16 20:31:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:34,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:31:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:34,494 INFO L225 Difference]: With dead ends: 14172 [2025-03-16 20:31:34,494 INFO L226 Difference]: Without dead ends: 5770 [2025-03-16 20:31:34,499 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:31:34,500 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 46 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3109 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:31:34,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3109 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2025-03-16 20:31:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5768. [2025-03-16 20:31:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5768 states, 5766 states have (on average 1.4498785986819285) internal successors, (8360), 5767 states have internal predecessors, (8360), 0 states have call successors, (0), 0 states 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:31:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5768 states to 5768 states and 8360 transitions. [2025-03-16 20:31:34,700 INFO L78 Accepts]: Start accepts. Automaton has 5768 states and 8360 transitions. Word has length 91 [2025-03-16 20:31:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:34,700 INFO L471 AbstractCegarLoop]: Abstraction has 5768 states and 8360 transitions. [2025-03-16 20:31:34,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:31:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5768 states and 8360 transitions. [2025-03-16 20:31:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:31:34,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:34,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:31:34,701 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:34,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1534330596, now seen corresponding path program 1 times [2025-03-16 20:31:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007153206] [2025-03-16 20:31:34,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:34,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:31:34,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:31:34,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:34,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:34,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007153206] [2025-03-16 20:31:34,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007153206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:34,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:34,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041013997] [2025-03-16 20:31:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:34,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:34,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:34,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:34,756 INFO L87 Difference]: Start difference. First operand 5768 states and 8360 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:31:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:34,801 INFO L93 Difference]: Finished difference Result 7872 states and 11302 transitions. [2025-03-16 20:31:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:34,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-16 20:31:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:34,806 INFO L225 Difference]: With dead ends: 7872 [2025-03-16 20:31:34,806 INFO L226 Difference]: Without dead ends: 3670 [2025-03-16 20:31:34,809 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:31:34,809 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 43 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3094 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:31:34,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3094 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-03-16 20:31:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-03-16 20:31:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 3666 states have (on average 1.470267321331151) internal successors, (5390), 3667 states have internal predecessors, (5390), 0 states have call successors, (0), 0 states 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:31:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5390 transitions. [2025-03-16 20:31:34,859 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5390 transitions. Word has length 93 [2025-03-16 20:31:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:34,859 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 5390 transitions. [2025-03-16 20:31:34,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:31:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5390 transitions. [2025-03-16 20:31:34,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:31:34,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:34,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:34,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:31:34,860 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:34,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1545960725, now seen corresponding path program 1 times [2025-03-16 20:31:34,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:34,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877385708] [2025-03-16 20:31:34,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:34,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:34,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:31:34,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:31:34,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:34,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:34,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877385708] [2025-03-16 20:31:34,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877385708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:34,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:34,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002924155] [2025-03-16 20:31:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:34,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:34,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:34,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:34,918 INFO L87 Difference]: Start difference. First operand 3668 states and 5390 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:31:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:34,950 INFO L93 Difference]: Finished difference Result 4722 states and 6847 transitions. [2025-03-16 20:31:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:34,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 20:31:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:34,955 INFO L225 Difference]: With dead ends: 4722 [2025-03-16 20:31:34,955 INFO L226 Difference]: Without dead ends: 2620 [2025-03-16 20:31:34,957 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:31:34,958 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 40 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3079 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:31:34,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3079 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2025-03-16 20:31:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2618. [2025-03-16 20:31:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2616 states have (on average 1.4984709480122325) internal successors, (3920), 2617 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states 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:31:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3920 transitions. [2025-03-16 20:31:34,996 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3920 transitions. Word has length 95 [2025-03-16 20:31:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:34,996 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 3920 transitions. [2025-03-16 20:31:34,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:31:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3920 transitions. [2025-03-16 20:31:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:31:34,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:34,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:34,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:31:34,997 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:34,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 241665038, now seen corresponding path program 1 times [2025-03-16 20:31:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708095596] [2025-03-16 20:31:34,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:35,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:31:35,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:31:35,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:35,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:35,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:35,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708095596] [2025-03-16 20:31:35,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708095596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:35,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961503331] [2025-03-16 20:31:35,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:35,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:35,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:35,703 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:31:35,705 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:31:35,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:31:35,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:31:35,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:35,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:35,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:31:35,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:36,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961503331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:36,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:36,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:31:36,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622844925] [2025-03-16 20:31:36,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:36,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:31:36,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:36,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:31:36,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:31:36,916 INFO L87 Difference]: Start difference. First operand 2618 states and 3920 transitions. Second operand has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:31:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:40,288 INFO L93 Difference]: Finished difference Result 11309 states and 15642 transitions. [2025-03-16 20:31:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-16 20:31:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 0 states have call successors, (0), 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 97 [2025-03-16 20:31:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:40,299 INFO L225 Difference]: With dead ends: 11309 [2025-03-16 20:31:40,299 INFO L226 Difference]: Without dead ends: 10167 [2025-03-16 20:31:40,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1310, Invalid=6700, Unknown=0, NotChecked=0, Total=8010 [2025-03-16 20:31:40,303 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 15924 mSDsluCounter, 6745 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15924 SdHoareTripleChecker+Valid, 8287 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:40,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15924 Valid, 8287 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 20:31:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10167 states. [2025-03-16 20:31:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10167 to 9543. [2025-03-16 20:31:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9543 states, 9541 states have (on average 1.3726024525731055) internal successors, (13096), 9542 states have internal predecessors, (13096), 0 states have call successors, (0), 0 states 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:31:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9543 states to 9543 states and 13096 transitions. [2025-03-16 20:31:40,489 INFO L78 Accepts]: Start accepts. Automaton has 9543 states and 13096 transitions. Word has length 97 [2025-03-16 20:31:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:40,489 INFO L471 AbstractCegarLoop]: Abstraction has 9543 states and 13096 transitions. [2025-03-16 20:31:40,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:31:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 9543 states and 13096 transitions. [2025-03-16 20:31:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:31:40,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:40,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:40,522 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:31:40,691 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,SelfDestructingSolverStorable25 [2025-03-16 20:31:40,691 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:40,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -86681077, now seen corresponding path program 1 times [2025-03-16 20:31:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:40,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121353456] [2025-03-16 20:31:40,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:40,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:31:40,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:31:40,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:40,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121353456] [2025-03-16 20:31:40,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121353456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:40,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537384306] [2025-03-16 20:31:40,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:40,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:40,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:40,972 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:31:40,974 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:31:41,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:31:41,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:31:41,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:41,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:41,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:31:41,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:41,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537384306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:42,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:42,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-16 20:31:42,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173825263] [2025-03-16 20:31:42,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:42,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 20:31:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:42,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 20:31:42,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-03-16 20:31:42,123 INFO L87 Difference]: Start difference. First operand 9543 states and 13096 transitions. Second operand has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:42,715 INFO L93 Difference]: Finished difference Result 24925 states and 33594 transitions. [2025-03-16 20:31:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:31:42,715 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-16 20:31:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:42,733 INFO L225 Difference]: With dead ends: 24925 [2025-03-16 20:31:42,733 INFO L226 Difference]: Without dead ends: 17538 [2025-03-16 20:31:42,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 20:31:42,740 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 13861 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13861 SdHoareTripleChecker+Valid, 4856 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:42,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13861 Valid, 4856 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:31:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17538 states. [2025-03-16 20:31:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17538 to 17362. [2025-03-16 20:31:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17362 states, 17360 states have (on average 1.3392857142857142) internal successors, (23250), 17361 states have internal predecessors, (23250), 0 states have call successors, (0), 0 states 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:31:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17362 states to 17362 states and 23250 transitions. [2025-03-16 20:31:43,120 INFO L78 Accepts]: Start accepts. Automaton has 17362 states and 23250 transitions. Word has length 98 [2025-03-16 20:31:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:43,120 INFO L471 AbstractCegarLoop]: Abstraction has 17362 states and 23250 transitions. [2025-03-16 20:31:43,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17362 states and 23250 transitions. [2025-03-16 20:31:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 20:31:43,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:43,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:43,130 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:31:43,322 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,SelfDestructingSolverStorable26 [2025-03-16 20:31:43,322 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:43,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 803172619, now seen corresponding path program 1 times [2025-03-16 20:31:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855140495] [2025-03-16 20:31:43,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:43,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:31:43,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:31:43,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:43,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:44,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:44,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855140495] [2025-03-16 20:31:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855140495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253766144] [2025-03-16 20:31:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:44,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:44,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:44,379 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:31:44,381 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:31:44,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 20:31:44,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 20:31:44,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:44,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:44,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:31:44,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:44,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253766144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:45,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:45,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2025-03-16 20:31:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363032991] [2025-03-16 20:31:45,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:45,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 20:31:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:45,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 20:31:45,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 20:31:45,870 INFO L87 Difference]: Start difference. First operand 17362 states and 23250 transitions. Second operand has 35 states, 35 states have (on average 7.257142857142857) internal successors, (254), 35 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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:31:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:48,714 INFO L93 Difference]: Finished difference Result 83548 states and 110790 transitions. [2025-03-16 20:31:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-16 20:31:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.257142857142857) internal successors, (254), 35 states have internal predecessors, (254), 0 states have call successors, (0), 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 98 [2025-03-16 20:31:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:48,788 INFO L225 Difference]: With dead ends: 83548 [2025-03-16 20:31:48,788 INFO L226 Difference]: Without dead ends: 68178 [2025-03-16 20:31:48,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=920, Invalid=3910, Unknown=0, NotChecked=0, Total=4830 [2025-03-16 20:31:48,806 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 22041 mSDsluCounter, 6748 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22041 SdHoareTripleChecker+Valid, 8278 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:48,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22041 Valid, 8278 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:31:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68178 states. [2025-03-16 20:31:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68178 to 67526. [2025-03-16 20:31:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67526 states, 67524 states have (on average 1.302455423256916) internal successors, (87947), 67525 states have internal predecessors, (87947), 0 states have call successors, (0), 0 states 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:31:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67526 states to 67526 states and 87947 transitions. [2025-03-16 20:31:50,484 INFO L78 Accepts]: Start accepts. Automaton has 67526 states and 87947 transitions. Word has length 98 [2025-03-16 20:31:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:50,484 INFO L471 AbstractCegarLoop]: Abstraction has 67526 states and 87947 transitions. [2025-03-16 20:31:50,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.257142857142857) internal successors, (254), 35 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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:31:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 67526 states and 87947 transitions. [2025-03-16 20:31:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 20:31:50,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:50,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:50,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:31:50,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:50,688 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1727514939, now seen corresponding path program 1 times [2025-03-16 20:31:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617444844] [2025-03-16 20:31:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:50,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:50,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:50,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:50,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:50,959 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:31:50,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617444844] [2025-03-16 20:31:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617444844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380914221] [2025-03-16 20:31:50,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:50,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:50,961 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:31:50,964 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:31:51,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:51,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:51,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:51,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:51,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:31:51,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:51,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380914221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:51,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:51,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-16 20:31:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301567752] [2025-03-16 20:31:51,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 20:31:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:51,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 20:31:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-16 20:31:51,953 INFO L87 Difference]: Start difference. First operand 67526 states and 87947 transitions. Second operand has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 25 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:55,292 INFO L93 Difference]: Finished difference Result 144404 states and 187842 transitions. [2025-03-16 20:31:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:31:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 25 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 20:31:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:55,368 INFO L225 Difference]: With dead ends: 144404 [2025-03-16 20:31:55,368 INFO L226 Difference]: Without dead ends: 82222 [2025-03-16 20:31:55,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=513, Invalid=1839, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 20:31:55,387 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 20430 mSDsluCounter, 6480 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20430 SdHoareTripleChecker+Valid, 7991 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:55,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20430 Valid, 7991 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:31:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82222 states. [2025-03-16 20:31:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82222 to 40772. [2025-03-16 20:31:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40772 states, 40770 states have (on average 1.2863134657836646) internal successors, (52443), 40771 states have internal predecessors, (52443), 0 states have call successors, (0), 0 states 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:31:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 52443 transitions. [2025-03-16 20:31:56,649 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 52443 transitions. Word has length 99 [2025-03-16 20:31:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:56,649 INFO L471 AbstractCegarLoop]: Abstraction has 40772 states and 52443 transitions. [2025-03-16 20:31:56,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 25 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 52443 transitions. [2025-03-16 20:31:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:31:56,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:56,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:56,658 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:31:56,851 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,SelfDestructingSolverStorable28 [2025-03-16 20:31:56,852 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:56,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 475003237, now seen corresponding path program 1 times [2025-03-16 20:31:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529603120] [2025-03-16 20:31:56,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:56,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:56,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:56,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:56,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529603120] [2025-03-16 20:31:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529603120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738338299] [2025-03-16 20:31:57,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:57,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:57,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:57,069 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:31:57,071 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:31:57,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:57,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:57,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:57,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:57,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:31:57,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:32:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:00,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:32:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738338299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:32:02,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:32:02,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 21] total 46 [2025-03-16 20:32:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319667737] [2025-03-16 20:32:02,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:32:02,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-16 20:32:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:02,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-16 20:32:02,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1845, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 20:32:02,384 INFO L87 Difference]: Start difference. First operand 40772 states and 52443 transitions. Second operand has 46 states, 46 states have (on average 5.565217391304348) internal successors, (256), 46 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)