./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0c7c69d3788b9174ce50b7ab42b39214a13bc3eceec60ee173c8e1ad7db186a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:24:50,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:24:51,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:24:51,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:24:51,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:24:51,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:24:51,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:24:51,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:24:51,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:24:51,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:24:51,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:24:51,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:24:51,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:24:51,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:24:51,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:24:51,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:24:51,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:24:51,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:24:51,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:24:51,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:24:51,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:24:51,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:24:51,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:24:51,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:24:51,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:24:51,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:24:51,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:24:51,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:24:51,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:24:51,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:24:51,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:24:51,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:24:51,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:24:51,036 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 -> e0c7c69d3788b9174ce50b7ab42b39214a13bc3eceec60ee173c8e1ad7db186a [2025-03-16 20:24:51,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:24:51,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:24:51,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:24:51,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:24:51,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:24:51,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:24:52,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430d2d119/864ab5820fe54e6cb8d7eb5936c35f6f/FLAGf31a1ce8d [2025-03-16 20:24:52,860 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:24:52,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:24:52,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430d2d119/864ab5820fe54e6cb8d7eb5936c35f6f/FLAGf31a1ce8d [2025-03-16 20:24:52,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430d2d119/864ab5820fe54e6cb8d7eb5936c35f6f [2025-03-16 20:24:52,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:24:52,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:24:52,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:24:52,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:24:52,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:24:52,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:24:52" (1/1) ... [2025-03-16 20:24:52,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19146bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:52, skipping insertion in model container [2025-03-16 20:24:52,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:24:52" (1/1) ... [2025-03-16 20:24:53,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:24:53,246 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.4.ufo.UNBOUNDED.pals+Problem12_label01.c[8712,8725] [2025-03-16 20:24:53,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label01.c[14267,14280] [2025-03-16 20:24:53,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:24:53,676 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:24:53,704 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.4.ufo.UNBOUNDED.pals+Problem12_label01.c[8712,8725] [2025-03-16 20:24:53,711 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.4.ufo.UNBOUNDED.pals+Problem12_label01.c[14267,14280] [2025-03-16 20:24:53,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:24:53,967 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:24:53,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53 WrapperNode [2025-03-16 20:24:53,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:24:53,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:24:53,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:24:53,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:24:53,974 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:24:53" (1/1) ... [2025-03-16 20:24:54,009 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:24:53" (1/1) ... [2025-03-16 20:24:54,218 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-03-16 20:24:54,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:24:54,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:24:54,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:24:54,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:24:54,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,440 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:24:54,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:24:54,684 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:24:54,684 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:24:54,684 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:24:54,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (1/1) ... [2025-03-16 20:24:54,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:24:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:24:54,709 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:24:54,713 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:24:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:24:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:24:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:24:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:24:54,810 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:24:54,812 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:24:57,954 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-03-16 20:24:57,954 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-03-16 20:24:57,955 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-03-16 20:24:58,064 INFO L? ?]: Removed 735 outVars from TransFormulas that were not future-live. [2025-03-16 20:24:58,064 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:24:58,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:24:58,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:24:58,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:24:58 BoogieIcfgContainer [2025-03-16 20:24:58,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:24:58,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:24:58,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:24:58,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:24:58,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:24:52" (1/3) ... [2025-03-16 20:24:58,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bad9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:24:58, skipping insertion in model container [2025-03-16 20:24:58,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:24:53" (2/3) ... [2025-03-16 20:24:58,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bad9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:24:58, skipping insertion in model container [2025-03-16 20:24:58,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:24:58" (3/3) ... [2025-03-16 20:24:58,104 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:24:58,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:24:58,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 822 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:24:58,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:24:58,184 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;@16603e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:24:58,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:24:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states 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:24:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:24:58,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:58,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:24:58,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:58,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash 640465911, now seen corresponding path program 1 times [2025-03-16 20:24:58,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:58,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722550351] [2025-03-16 20:24:58,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:58,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:58,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:24:58,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:24:58,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:58,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:58,372 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:24:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722550351] [2025-03-16 20:24:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722550351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:24:58,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:24:58,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:24:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982060028] [2025-03-16 20:24:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:24:58,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:24:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:58,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:24:58,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:24:58,397 INFO L87 Difference]: Start difference. First operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:24:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:58,475 INFO L93 Difference]: Finished difference Result 1617 states and 3182 transitions. [2025-03-16 20:24:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:24:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:24:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:58,489 INFO L225 Difference]: With dead ends: 1617 [2025-03-16 20:24:58,489 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:24:58,492 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:24:58,496 INFO L435 NwaCegarLoop]: 1552 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, 1552 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:24:58,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:24:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:24:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:24:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8970588235294117) internal successors, (1548), 817 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states 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:24:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1548 transitions. [2025-03-16 20:24:58,558 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1548 transitions. Word has length 19 [2025-03-16 20:24:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:58,558 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1548 transitions. [2025-03-16 20:24:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:24:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1548 transitions. [2025-03-16 20:24:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:24:58,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:58,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:24:58,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:24:58,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2146949576, now seen corresponding path program 1 times [2025-03-16 20:24:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841469771] [2025-03-16 20:24:58,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:58,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:24:58,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:24:58,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:58,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:58,730 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:24:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:58,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841469771] [2025-03-16 20:24:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841469771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:24:58,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:24:58,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:24:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869993717] [2025-03-16 20:24:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:24:58,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:24:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:58,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:24:58,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:24:58,732 INFO L87 Difference]: Start difference. First operand 818 states and 1548 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:24:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:58,793 INFO L93 Difference]: Finished difference Result 858 states and 1610 transitions. [2025-03-16 20:24:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:24:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 20:24:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:58,798 INFO L225 Difference]: With dead ends: 858 [2025-03-16 20:24:58,798 INFO L226 Difference]: Without dead ends: 818 [2025-03-16 20:24:58,798 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:24:58,799 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 0 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:58,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4614 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:24:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-16 20:24:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-03-16 20:24:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 1.8688725490196079) internal successors, (1525), 817 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states 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:24:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1525 transitions. [2025-03-16 20:24:58,833 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1525 transitions. Word has length 19 [2025-03-16 20:24:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:58,833 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1525 transitions. [2025-03-16 20:24:58,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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:24:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1525 transitions. [2025-03-16 20:24:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:24:58,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:58,835 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] [2025-03-16 20:24:58,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:24:58,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:58,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1633251230, now seen corresponding path program 1 times [2025-03-16 20:24:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:58,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477601962] [2025-03-16 20:24:58,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:58,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:58,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:24:58,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:24:58,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:58,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:59,000 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:24:59,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:59,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477601962] [2025-03-16 20:24:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477601962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:24:59,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:24:59,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:24:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422652828] [2025-03-16 20:24:59,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:24:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:24:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:59,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:24:59,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:24:59,001 INFO L87 Difference]: Start difference. First operand 818 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:24:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:59,171 INFO L93 Difference]: Finished difference Result 1114 states and 1997 transitions. [2025-03-16 20:24:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:24:59,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 20:24:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:59,178 INFO L225 Difference]: With dead ends: 1114 [2025-03-16 20:24:59,178 INFO L226 Difference]: Without dead ends: 1077 [2025-03-16 20:24:59,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:24:59,182 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 6359 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6359 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:59,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6359 Valid, 1993 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:24:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-16 20:24:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 853. [2025-03-16 20:24:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8578143360752057) internal successors, (1581), 852 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states 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:24:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1581 transitions. [2025-03-16 20:24:59,213 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1581 transitions. Word has length 41 [2025-03-16 20:24:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:59,213 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1581 transitions. [2025-03-16 20:24:59,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:24:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1581 transitions. [2025-03-16 20:24:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:24:59,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:59,216 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] [2025-03-16 20:24:59,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:24:59,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:59,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1854186780, now seen corresponding path program 1 times [2025-03-16 20:24:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078018720] [2025-03-16 20:24:59,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:59,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:24:59,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:24:59,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:59,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:59,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:59,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078018720] [2025-03-16 20:24:59,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078018720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:24:59,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:24:59,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:24:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265430138] [2025-03-16 20:24:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:24:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:24:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:59,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:24:59,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:24:59,440 INFO L87 Difference]: Start difference. First operand 853 states and 1581 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:24:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:59,544 INFO L93 Difference]: Finished difference Result 927 states and 1697 transitions. [2025-03-16 20:24:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:24:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:24:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:59,549 INFO L225 Difference]: With dead ends: 927 [2025-03-16 20:24:59,549 INFO L226 Difference]: Without dead ends: 855 [2025-03-16 20:24:59,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:24:59,551 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 5928 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5928 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:59,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5928 Valid, 1684 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:24:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-16 20:24:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 853. [2025-03-16 20:24:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8566392479435958) internal successors, (1580), 852 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states 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:24:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1580 transitions. [2025-03-16 20:24:59,577 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1580 transitions. Word has length 43 [2025-03-16 20:24:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:59,578 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1580 transitions. [2025-03-16 20:24:59,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:24:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1580 transitions. [2025-03-16 20:24:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:24:59,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:59,581 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] [2025-03-16 20:24:59,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:24:59,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:59,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1855229465, now seen corresponding path program 1 times [2025-03-16 20:24:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:59,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795654634] [2025-03-16 20:24:59,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:59,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:59,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:24:59,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:24:59,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:59,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:59,669 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:24:59,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795654634] [2025-03-16 20:24:59,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795654634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:24:59,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:24:59,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:24:59,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993143070] [2025-03-16 20:24:59,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:24:59,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:24:59,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:59,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:24:59,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:24:59,671 INFO L87 Difference]: Start difference. First operand 853 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:24:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:59,702 INFO L93 Difference]: Finished difference Result 986 states and 1789 transitions. [2025-03-16 20:24:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:24:59,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 20:24:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:59,706 INFO L225 Difference]: With dead ends: 986 [2025-03-16 20:24:59,706 INFO L226 Difference]: Without dead ends: 914 [2025-03-16 20:24:59,706 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:24:59,707 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:59,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:24:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-16 20:24:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2025-03-16 20:24:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states 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:24:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-03-16 20:24:59,727 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 43 [2025-03-16 20:24:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:59,728 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-03-16 20:24:59,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:24:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-03-16 20:24:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:24:59,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:59,730 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] [2025-03-16 20:24:59,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:24:59,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1644230272, now seen corresponding path program 1 times [2025-03-16 20:24:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763023811] [2025-03-16 20:24:59,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:59,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:24:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:24:59,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:59,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:59,868 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:24:59,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763023811] [2025-03-16 20:24:59,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763023811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:24:59,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:24:59,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:24:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320873509] [2025-03-16 20:24:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:24:59,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:24:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:59,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:24:59,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:24:59,871 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:24:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:59,897 INFO L93 Difference]: Finished difference Result 916 states and 1674 transitions. [2025-03-16 20:24:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:24:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 20:24:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:59,901 INFO L225 Difference]: With dead ends: 916 [2025-03-16 20:24:59,902 INFO L226 Difference]: Without dead ends: 914 [2025-03-16 20:24:59,902 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:24:59,903 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:24:59,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4561 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:24:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-16 20:24:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2025-03-16 20:24:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 912 states have (on average 1.831140350877193) internal successors, (1670), 913 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states 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:24:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1670 transitions. [2025-03-16 20:24:59,922 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1670 transitions. Word has length 44 [2025-03-16 20:24:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:24:59,922 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1670 transitions. [2025-03-16 20:24:59,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:24:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1670 transitions. [2025-03-16 20:24:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:24:59,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:24:59,923 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] [2025-03-16 20:24:59,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:24:59,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:24:59,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:24:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2138271558, now seen corresponding path program 1 times [2025-03-16 20:24:59,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:24:59,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690188448] [2025-03-16 20:24:59,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:24:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:24:59,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:24:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:24:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:24:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:24:59,961 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:24:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:24:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690188448] [2025-03-16 20:24:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690188448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:24:59,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:24:59,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:24:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724644635] [2025-03-16 20:24:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:24:59,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:24:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:59,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:24:59,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:24:59,963 INFO L87 Difference]: Start difference. First operand 914 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:24:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:24:59,983 INFO L93 Difference]: Finished difference Result 1164 states and 2050 transitions. [2025-03-16 20:24:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:24:59,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:24:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:24:59,988 INFO L225 Difference]: With dead ends: 1164 [2025-03-16 20:24:59,988 INFO L226 Difference]: Without dead ends: 1031 [2025-03-16 20:24:59,988 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:24:59,989 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 1483 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1619 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:24:59,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1619 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:24:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-03-16 20:25:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1029. [2025-03-16 20:25:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1027 states have (on average 1.7925998052580332) internal successors, (1841), 1028 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states 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:25:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1841 transitions. [2025-03-16 20:25:00,006 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1841 transitions. Word has length 45 [2025-03-16 20:25:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:00,006 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1841 transitions. [2025-03-16 20:25:00,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:25:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1841 transitions. [2025-03-16 20:25:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:00,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:00,007 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] [2025-03-16 20:25:00,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:25:00,007 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:00,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1588482630, now seen corresponding path program 1 times [2025-03-16 20:25:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:00,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892807095] [2025-03-16 20:25:00,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:00,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:00,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:00,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:00,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:00,052 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:25:00,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:00,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892807095] [2025-03-16 20:25:00,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892807095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:00,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:00,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:00,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773279705] [2025-03-16 20:25:00,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:00,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:00,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:00,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:00,053 INFO L87 Difference]: Start difference. First operand 1029 states and 1841 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:25:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:00,073 INFO L93 Difference]: Finished difference Result 1493 states and 2535 transitions. [2025-03-16 20:25:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:00,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:00,078 INFO L225 Difference]: With dead ends: 1493 [2025-03-16 20:25:00,078 INFO L226 Difference]: Without dead ends: 1245 [2025-03-16 20:25:00,078 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:25:00,079 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 1481 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1621 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:25:00,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 1621 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-03-16 20:25:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1243. [2025-03-16 20:25:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1241 states have (on average 1.7332796132151491) internal successors, (2151), 1242 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states 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:25:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2151 transitions. [2025-03-16 20:25:00,101 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2151 transitions. Word has length 45 [2025-03-16 20:25:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:00,102 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2151 transitions. [2025-03-16 20:25:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:25:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2151 transitions. [2025-03-16 20:25:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:00,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:00,102 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] [2025-03-16 20:25:00,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:25:00,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:00,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2090513338, now seen corresponding path program 1 times [2025-03-16 20:25:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:00,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433354091] [2025-03-16 20:25:00,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:00,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:00,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:00,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:00,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:00,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:00,195 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:25:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433354091] [2025-03-16 20:25:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433354091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:00,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:00,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083261572] [2025-03-16 20:25:00,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:00,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:00,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:00,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:00,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:00,201 INFO L87 Difference]: Start difference. First operand 1243 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:25:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:00,244 INFO L93 Difference]: Finished difference Result 2103 states and 3409 transitions. [2025-03-16 20:25:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:00,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-16 20:25:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:00,254 INFO L225 Difference]: With dead ends: 2103 [2025-03-16 20:25:00,257 INFO L226 Difference]: Without dead ends: 1641 [2025-03-16 20:25:00,259 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:25:00,259 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1485 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1625 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:25:00,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-03-16 20:25:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1639. [2025-03-16 20:25:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1637 states have (on average 1.653634697617593) internal successors, (2707), 1638 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states 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:25:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2707 transitions. [2025-03-16 20:25:00,302 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2707 transitions. Word has length 45 [2025-03-16 20:25:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:00,302 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2707 transitions. [2025-03-16 20:25:00,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:25:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2707 transitions. [2025-03-16 20:25:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:25:00,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:00,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:00,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:25:00,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1194131558, now seen corresponding path program 1 times [2025-03-16 20:25:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:00,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355745490] [2025-03-16 20:25:00,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:00,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:25:00,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:25:00,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:00,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:00,365 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:25:00,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:00,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355745490] [2025-03-16 20:25:00,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355745490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:00,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:00,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566632708] [2025-03-16 20:25:00,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:00,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:00,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:00,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:00,367 INFO L87 Difference]: Start difference. First operand 1639 states and 2707 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:00,417 INFO L93 Difference]: Finished difference Result 2542 states and 4041 transitions. [2025-03-16 20:25:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:00,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 20:25:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:00,423 INFO L225 Difference]: With dead ends: 2542 [2025-03-16 20:25:00,424 INFO L226 Difference]: Without dead ends: 2043 [2025-03-16 20:25:00,426 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:25:00,427 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 1484 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1626 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:25:00,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-03-16 20:25:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2025-03-16 20:25:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2039 states have (on average 1.6071603727317312) internal successors, (3277), 2040 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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:25:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3277 transitions. [2025-03-16 20:25:00,466 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3277 transitions. Word has length 47 [2025-03-16 20:25:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:00,466 INFO L471 AbstractCegarLoop]: Abstraction has 2041 states and 3277 transitions. [2025-03-16 20:25:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3277 transitions. [2025-03-16 20:25:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:25:00,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:00,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:00,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:25:00,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1806794269, now seen corresponding path program 1 times [2025-03-16 20:25:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440710832] [2025-03-16 20:25:00,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:00,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:25:00,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:25:00,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:00,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:00,559 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:25:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440710832] [2025-03-16 20:25:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440710832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511326163] [2025-03-16 20:25:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:00,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:00,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:00,560 INFO L87 Difference]: Start difference. First operand 2041 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:05,287 INFO L93 Difference]: Finished difference Result 4296 states and 7586 transitions. [2025-03-16 20:25:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 20:25:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:05,296 INFO L225 Difference]: With dead ends: 4296 [2025-03-16 20:25:05,296 INFO L226 Difference]: Without dead ends: 3543 [2025-03-16 20:25:05,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:25:05,298 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 2390 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:05,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 779 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 20:25:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2025-03-16 20:25:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3543. [2025-03-16 20:25:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3541 states have (on average 1.522451284947755) internal successors, (5391), 3542 states have internal predecessors, (5391), 0 states have call successors, (0), 0 states 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:25:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 5391 transitions. [2025-03-16 20:25:05,354 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 5391 transitions. Word has length 47 [2025-03-16 20:25:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:05,354 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 5391 transitions. [2025-03-16 20:25:05,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 5391 transitions. [2025-03-16 20:25:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:05,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:05,355 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] [2025-03-16 20:25:05,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:25:05,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:05,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash 96347508, now seen corresponding path program 1 times [2025-03-16 20:25:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:05,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764173747] [2025-03-16 20:25:05,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:05,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:05,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:05,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:05,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:25:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:05,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764173747] [2025-03-16 20:25:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764173747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:05,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982202695] [2025-03-16 20:25:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:05,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:05,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:05,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:05,445 INFO L87 Difference]: Start difference. First operand 3543 states and 5391 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:25:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:05,561 INFO L93 Difference]: Finished difference Result 8849 states and 13004 transitions. [2025-03-16 20:25:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:05,580 INFO L225 Difference]: With dead ends: 8849 [2025-03-16 20:25:05,580 INFO L226 Difference]: Without dead ends: 7591 [2025-03-16 20:25:05,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:05,585 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 4693 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:05,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 3288 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2025-03-16 20:25:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 4799. [2025-03-16 20:25:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4799 states, 4797 states have (on average 1.4957264957264957) internal successors, (7175), 4798 states have internal predecessors, (7175), 0 states have call successors, (0), 0 states 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:25:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4799 states to 4799 states and 7175 transitions. [2025-03-16 20:25:05,715 INFO L78 Accepts]: Start accepts. Automaton has 4799 states and 7175 transitions. Word has length 61 [2025-03-16 20:25:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:05,715 INFO L471 AbstractCegarLoop]: Abstraction has 4799 states and 7175 transitions. [2025-03-16 20:25:05,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:25:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4799 states and 7175 transitions. [2025-03-16 20:25:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:05,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:05,720 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] [2025-03-16 20:25:05,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:25:05,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:05,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash -453441420, now seen corresponding path program 1 times [2025-03-16 20:25:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511168851] [2025-03-16 20:25:05,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:05,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:05,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:05,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:05,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:25:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511168851] [2025-03-16 20:25:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511168851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:05,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497939206] [2025-03-16 20:25:05,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:05,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:05,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:05,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:05,811 INFO L87 Difference]: Start difference. First operand 4799 states and 7175 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:05,947 INFO L93 Difference]: Finished difference Result 10105 states and 14788 transitions. [2025-03-16 20:25:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:05,966 INFO L225 Difference]: With dead ends: 10105 [2025-03-16 20:25:05,967 INFO L226 Difference]: Without dead ends: 8847 [2025-03-16 20:25:05,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:05,972 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4687 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 3297 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:05,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 3297 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8847 states. [2025-03-16 20:25:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8847 to 6687. [2025-03-16 20:25:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6687 states, 6685 states have (on average 1.4706058339566193) internal successors, (9831), 6686 states have internal predecessors, (9831), 0 states have call successors, (0), 0 states 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:25:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 9831 transitions. [2025-03-16 20:25:06,153 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 9831 transitions. Word has length 61 [2025-03-16 20:25:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:06,153 INFO L471 AbstractCegarLoop]: Abstraction has 6687 states and 9831 transitions. [2025-03-16 20:25:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 9831 transitions. [2025-03-16 20:25:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:06,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,155 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] [2025-03-16 20:25:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:25:06,155 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 162529908, now seen corresponding path program 1 times [2025-03-16 20:25:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43399821] [2025-03-16 20:25:06,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:06,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:06,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:25:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43399821] [2025-03-16 20:25:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43399821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681321986] [2025-03-16 20:25:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:06,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:06,242 INFO L87 Difference]: Start difference. First operand 6687 states and 9831 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:25:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:06,436 INFO L93 Difference]: Finished difference Result 11361 states and 16572 transitions. [2025-03-16 20:25:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:06,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:06,452 INFO L225 Difference]: With dead ends: 11361 [2025-03-16 20:25:06,453 INFO L226 Difference]: Without dead ends: 10103 [2025-03-16 20:25:06,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:06,458 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4651 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4651 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:06,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4651 Valid, 3354 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10103 states. [2025-03-16 20:25:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10103 to 7943. [2025-03-16 20:25:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7943 states, 7941 states have (on average 1.4626621332325904) internal successors, (11615), 7942 states have internal predecessors, (11615), 0 states have call successors, (0), 0 states 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:25:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 11615 transitions. [2025-03-16 20:25:06,658 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 11615 transitions. Word has length 61 [2025-03-16 20:25:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:06,658 INFO L471 AbstractCegarLoop]: Abstraction has 7943 states and 11615 transitions. [2025-03-16 20:25:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:25:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 11615 transitions. [2025-03-16 20:25:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:06,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:06,662 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] [2025-03-16 20:25:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:25:06,662 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:06,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1862143114, now seen corresponding path program 1 times [2025-03-16 20:25:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306788871] [2025-03-16 20:25:06,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:06,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:06,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:06,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:06,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306788871] [2025-03-16 20:25:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306788871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277851614] [2025-03-16 20:25:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:06,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:06,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:06,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:06,779 INFO L87 Difference]: Start difference. First operand 7943 states and 11615 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:25:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:06,874 INFO L93 Difference]: Finished difference Result 11996 states and 17467 transitions. [2025-03-16 20:25:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:06,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 20:25:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:06,885 INFO L225 Difference]: With dead ends: 11996 [2025-03-16 20:25:06,885 INFO L226 Difference]: Without dead ends: 6338 [2025-03-16 20:25:06,910 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:25:06,912 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3067 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:25:06,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3067 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2025-03-16 20:25:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6336. [2025-03-16 20:25:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 6334 states have (on average 1.4777391853489106) internal successors, (9360), 6335 states have internal predecessors, (9360), 0 states have call successors, (0), 0 states 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:25:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 9360 transitions. [2025-03-16 20:25:07,035 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 9360 transitions. Word has length 63 [2025-03-16 20:25:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,036 INFO L471 AbstractCegarLoop]: Abstraction has 6336 states and 9360 transitions. [2025-03-16 20:25:07,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:25:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 9360 transitions. [2025-03-16 20:25:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:07,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,037 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] [2025-03-16 20:25:07,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:25:07,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1705173780, now seen corresponding path program 1 times [2025-03-16 20:25:07,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012566624] [2025-03-16 20:25:07,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:07,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:07,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:25:07,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012566624] [2025-03-16 20:25:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012566624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:07,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233597422] [2025-03-16 20:25:07,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:07,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:07,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:07,127 INFO L87 Difference]: Start difference. First operand 6336 states and 9360 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:25:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,275 INFO L93 Difference]: Finished difference Result 9930 states and 14549 transitions. [2025-03-16 20:25:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:07,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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 63 [2025-03-16 20:25:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,290 INFO L225 Difference]: With dead ends: 9930 [2025-03-16 20:25:07,291 INFO L226 Difference]: Without dead ends: 9032 [2025-03-16 20:25:07,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:07,295 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 4655 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:07,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 3322 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9032 states. [2025-03-16 20:25:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9032 to 7232. [2025-03-16 20:25:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 7230 states have (on average 1.4716459197787) internal successors, (10640), 7231 states have internal predecessors, (10640), 0 states have call successors, (0), 0 states 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:25:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 10640 transitions. [2025-03-16 20:25:07,411 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 10640 transitions. Word has length 63 [2025-03-16 20:25:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,411 INFO L471 AbstractCegarLoop]: Abstraction has 7232 states and 10640 transitions. [2025-03-16 20:25:07,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:25:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 10640 transitions. [2025-03-16 20:25:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:25:07,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,412 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] [2025-03-16 20:25:07,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:25:07,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1410201656, now seen corresponding path program 1 times [2025-03-16 20:25:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307550998] [2025-03-16 20:25:07,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:25:07,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:25:07,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307550998] [2025-03-16 20:25:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307550998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698224553] [2025-03-16 20:25:07,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:07,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:07,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,479 INFO L87 Difference]: Start difference. First operand 7232 states and 10640 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:25:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,522 INFO L93 Difference]: Finished difference Result 9700 states and 14162 transitions. [2025-03-16 20:25:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:07,522 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:25:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,529 INFO L225 Difference]: With dead ends: 9700 [2025-03-16 20:25:07,529 INFO L226 Difference]: Without dead ends: 4770 [2025-03-16 20:25:07,534 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:25:07,535 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 37 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3052 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:25:07,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3052 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2025-03-16 20:25:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 4768. [2025-03-16 20:25:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4768 states, 4766 states have (on average 1.4846831724716743) internal successors, (7076), 4767 states have internal predecessors, (7076), 0 states have call successors, (0), 0 states 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:25:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 7076 transitions. [2025-03-16 20:25:07,628 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 7076 transitions. Word has length 64 [2025-03-16 20:25:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,629 INFO L471 AbstractCegarLoop]: Abstraction has 4768 states and 7076 transitions. [2025-03-16 20:25:07,629 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:25:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 7076 transitions. [2025-03-16 20:25:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:25:07,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,630 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] [2025-03-16 20:25:07,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:25:07,630 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2134590337, now seen corresponding path program 1 times [2025-03-16 20:25:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841782188] [2025-03-16 20:25:07,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:25:07,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:25:07,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841782188] [2025-03-16 20:25:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841782188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561563961] [2025-03-16 20:25:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:07,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,698 INFO L87 Difference]: Start difference. First operand 4768 states and 7076 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:25:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,728 INFO L93 Difference]: Finished difference Result 6004 states and 8816 transitions. [2025-03-16 20:25:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:07,728 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:25:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,733 INFO L225 Difference]: With dead ends: 6004 [2025-03-16 20:25:07,733 INFO L226 Difference]: Without dead ends: 3538 [2025-03-16 20:25:07,736 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:25:07,736 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 34 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3037 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:25:07,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3037 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2025-03-16 20:25:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3536. [2025-03-16 20:25:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3534 states have (on average 1.5042444821731749) internal successors, (5316), 3535 states have internal predecessors, (5316), 0 states have call successors, (0), 0 states 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:25:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 5316 transitions. [2025-03-16 20:25:07,773 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 5316 transitions. Word has length 66 [2025-03-16 20:25:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,773 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 5316 transitions. [2025-03-16 20:25:07,774 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:25:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 5316 transitions. [2025-03-16 20:25:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:25:07,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,774 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] [2025-03-16 20:25:07,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:25:07,775 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1210827322, now seen corresponding path program 1 times [2025-03-16 20:25:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052865927] [2025-03-16 20:25:07,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:25:07,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:25:07,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:07,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:07,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052865927] [2025-03-16 20:25:07,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052865927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:07,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:07,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169125523] [2025-03-16 20:25:07,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:07,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:07,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:07,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:07,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:07,833 INFO L87 Difference]: Start difference. First operand 3536 states and 5316 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:07,855 INFO L93 Difference]: Finished difference Result 4156 states and 6176 transitions. [2025-03-16 20:25:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:07,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:25:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:07,860 INFO L225 Difference]: With dead ends: 4156 [2025-03-16 20:25:07,860 INFO L226 Difference]: Without dead ends: 2922 [2025-03-16 20:25:07,861 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:25:07,861 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 31 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3022 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:25:07,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-16 20:25:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2920. [2025-03-16 20:25:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2918 states have (on average 1.523989033584647) internal successors, (4447), 2919 states have internal predecessors, (4447), 0 states have call successors, (0), 0 states 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:25:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4447 transitions. [2025-03-16 20:25:07,888 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4447 transitions. Word has length 68 [2025-03-16 20:25:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:07,888 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4447 transitions. [2025-03-16 20:25:07,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4447 transitions. [2025-03-16 20:25:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:25:07,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:07,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:07,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:25:07,890 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:07,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 301011955, now seen corresponding path program 1 times [2025-03-16 20:25:07,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708091449] [2025-03-16 20:25:07,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:07,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:07,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:07,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:07,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708091449] [2025-03-16 20:25:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708091449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531714302] [2025-03-16 20:25:09,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:09,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:09,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:09,162 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:25:09,164 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:25:09,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:09,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:09,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:09,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:09,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:25:09,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:09,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:10,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531714302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:10,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:10,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-16 20:25:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79001341] [2025-03-16 20:25:10,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:10,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 20:25:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:10,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 20:25:10,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-03-16 20:25:10,433 INFO L87 Difference]: Start difference. First operand 2920 states and 4447 transitions. Second operand has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:12,863 INFO L93 Difference]: Finished difference Result 6014 states and 8700 transitions. [2025-03-16 20:25:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 20:25:12,864 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 20:25:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:12,872 INFO L225 Difference]: With dead ends: 6014 [2025-03-16 20:25:12,873 INFO L226 Difference]: Without dead ends: 5396 [2025-03-16 20:25:12,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=999, Invalid=4257, Unknown=0, NotChecked=0, Total=5256 [2025-03-16 20:25:12,878 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 23522 mSDsluCounter, 6468 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23522 SdHoareTripleChecker+Valid, 7965 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:12,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23522 Valid, 7965 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:25:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2025-03-16 20:25:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5296. [2025-03-16 20:25:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 5294 states have (on average 1.438420853796751) internal successors, (7615), 5295 states have internal predecessors, (7615), 0 states have call successors, (0), 0 states 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:25:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 7615 transitions. [2025-03-16 20:25:12,956 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 7615 transitions. Word has length 70 [2025-03-16 20:25:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 5296 states and 7615 transitions. [2025-03-16 20:25:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.535714285714286) internal successors, (183), 27 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 7615 transitions. [2025-03-16 20:25:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:25:12,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,958 INFO L218 NwaCegarLoop]: trace histogram [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:25:12,970 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:25:13,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:13,159 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:13,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1576910278, now seen corresponding path program 1 times [2025-03-16 20:25:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916095625] [2025-03-16 20:25:13,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:13,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:13,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:13,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:13,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:13,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916095625] [2025-03-16 20:25:13,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916095625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:13,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831366418] [2025-03-16 20:25:13,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:13,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:13,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:13,452 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:25:13,454 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:25:13,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:13,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:13,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:13,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:13,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 20:25:13,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:14,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831366418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:16,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 18] total 41 [2025-03-16 20:25:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080619579] [2025-03-16 20:25:16,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:16,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 20:25:16,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:16,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 20:25:16,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 20:25:16,646 INFO L87 Difference]: Start difference. First operand 5296 states and 7615 transitions. Second operand has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:25:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:54,037 INFO L93 Difference]: Finished difference Result 26624 states and 36142 transitions. [2025-03-16 20:25:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2025-03-16 20:25:54,037 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 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 71 [2025-03-16 20:25:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:54,064 INFO L225 Difference]: With dead ends: 26624 [2025-03-16 20:25:54,064 INFO L226 Difference]: Without dead ends: 23630 [2025-03-16 20:25:54,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29850 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=10208, Invalid=59752, Unknown=0, NotChecked=0, Total=69960 [2025-03-16 20:25:54,080 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 24582 mSDsluCounter, 19803 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24582 SdHoareTripleChecker+Valid, 21356 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:54,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24582 Valid, 21356 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 20:25:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23630 states. [2025-03-16 20:25:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23630 to 8436. [2025-03-16 20:25:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8436 states, 8434 states have (on average 1.3928147972492293) internal successors, (11747), 8435 states have internal predecessors, (11747), 0 states have call successors, (0), 0 states 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:25:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 11747 transitions. [2025-03-16 20:25:54,364 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 11747 transitions. Word has length 71 [2025-03-16 20:25:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:54,365 INFO L471 AbstractCegarLoop]: Abstraction has 8436 states and 11747 transitions. [2025-03-16 20:25:54,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.682926829268292) internal successors, (192), 41 states have internal predecessors, (192), 0 states have call successors, (0), 0 states 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:25:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 11747 transitions. [2025-03-16 20:25:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:25:54,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:54,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:54,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 20:25:54,570 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,SelfDestructingSolverStorable20 [2025-03-16 20:25:54,570 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:54,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash -416617920, now seen corresponding path program 1 times [2025-03-16 20:25:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:54,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344122227] [2025-03-16 20:25:54,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:54,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:25:54,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:25:54,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:54,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:55,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344122227] [2025-03-16 20:25:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344122227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049127785] [2025-03-16 20:25:55,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:55,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:55,930 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:25:55,931 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:25:55,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:25:56,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:25:56,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:56,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:56,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:25:56,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:56,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049127785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:57,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 16] total 51 [2025-03-16 20:25:57,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741469266] [2025-03-16 20:25:57,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:57,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-16 20:25:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:57,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-16 20:25:57,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 20:25:57,727 INFO L87 Difference]: Start difference. First operand 8436 states and 11747 transitions. Second operand has 51 states, 51 states have (on average 4.03921568627451) internal successors, (206), 51 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)