./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:50:40,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:50:40,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:50:41,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:50:41,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:50:41,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:50:41,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:50:41,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:50:41,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:50:41,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:50:41,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:50:41,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:50:41,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:50:41,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:50:41,013 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:50:41,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:50:41,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:50:41,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:50:41,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:50:41,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:50:41,015 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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2025-03-03 14:50:41,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:50:41,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:50:41,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:50:41,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:50:41,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:50:41,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:42,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b20d40/187ea0456ab840afb5683ecbbaf1e6c6/FLAGa4c472d8b [2025-03-03 14:50:42,644 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:50:42,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:42,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b20d40/187ea0456ab840afb5683ecbbaf1e6c6/FLAGa4c472d8b [2025-03-03 14:50:42,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240b20d40/187ea0456ab840afb5683ecbbaf1e6c6 [2025-03-03 14:50:42,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:50:42,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:50:42,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:50:42,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:50:42,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:50:42,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:42" (1/1) ... [2025-03-03 14:50:42,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2dec28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:42, skipping insertion in model container [2025-03-03 14:50:42,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:42" (1/1) ... [2025-03-03 14:50:42,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:50:43,098 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/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2025-03-03 14:50:43,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:50:43,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:50:43,148 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/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2025-03-03 14:50:43,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:50:43,157 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:50:43,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43 WrapperNode [2025-03-03 14:50:43,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:50:43,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:50:43,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:50:43,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:50:43,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,190 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2025-03-03 14:50:43,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:50:43,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:50:43,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:50:43,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:50:43,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,218 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:50:43,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:50:43,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:50:43,232 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:50:43,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:50:43,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (1/1) ... [2025-03-03 14:50:43,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:50:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:43,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:50:43,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:50:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:50:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:50:43,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:50:43,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:50:43,346 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:50:43,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:50:43,620 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 14:50:43,620 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:50:43,630 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:50:43,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:50:43,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:43 BoogieIcfgContainer [2025-03-03 14:50:43,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:50:43,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:50:43,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:50:43,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:50:43,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:50:42" (1/3) ... [2025-03-03 14:50:43,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ac5daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:43, skipping insertion in model container [2025-03-03 14:50:43,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:43" (2/3) ... [2025-03-03 14:50:43,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ac5daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:43, skipping insertion in model container [2025-03-03 14:50:43,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:43" (3/3) ... [2025-03-03 14:50:43,639 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:43,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:50:43,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:50:43,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:50:43,701 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;@58f82d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:50:43,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:50:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 1.690909090909091) internal successors, (93), 56 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:50:43,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:43,710 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-03 14:50:43,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:43,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2026913331, now seen corresponding path program 1 times [2025-03-03 14:50:43,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:43,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998852285] [2025-03-03 14:50:43,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:43,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:50:43,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:50:43,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:43,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998852285] [2025-03-03 14:50:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998852285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:43,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:50:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546698807] [2025-03-03 14:50:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:43,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:50:43,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:43,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:50:43,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:50:43,914 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 1.690909090909091) internal successors, (93), 56 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-03 14:50:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:43,927 INFO L93 Difference]: Finished difference Result 90 states and 146 transitions. [2025-03-03 14:50:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:50:43,931 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-03 14:50:43,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:43,936 INFO L225 Difference]: With dead ends: 90 [2025-03-03 14:50:43,937 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 14:50:43,939 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-03 14:50:43,943 INFO L435 NwaCegarLoop]: 88 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, 88 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-03 14:50:43,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 14:50:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 14:50:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 53 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2025-03-03 14:50:43,966 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 88 transitions. Word has length 19 [2025-03-03 14:50:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:43,967 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 88 transitions. [2025-03-03 14:50:43,967 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-03 14:50:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 88 transitions. [2025-03-03 14:50:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:50:43,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:43,968 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-03 14:50:43,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:50:43,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:43,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1521354706, now seen corresponding path program 1 times [2025-03-03 14:50:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:43,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309881559] [2025-03-03 14:50:43,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:50:44,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:50:44,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:44,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:44,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:44,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309881559] [2025-03-03 14:50:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309881559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:44,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357044616] [2025-03-03 14:50:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:44,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:44,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:44,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:44,196 INFO L87 Difference]: Start difference. First operand 54 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-03 14:50:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:44,245 INFO L93 Difference]: Finished difference Result 90 states and 142 transitions. [2025-03-03 14:50:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:44,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-03 14:50:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:44,248 INFO L225 Difference]: With dead ends: 90 [2025-03-03 14:50:44,248 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 14:50:44,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:44,249 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:44,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 14:50:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 14:50:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2025-03-03 14:50:44,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 19 [2025-03-03 14:50:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:44,254 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-03-03 14:50:44,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-03 14:50:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2025-03-03 14:50:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:50:44,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:44,255 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] [2025-03-03 14:50:44,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:50:44,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:44,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1280739170, now seen corresponding path program 1 times [2025-03-03 14:50:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114639139] [2025-03-03 14:50:44,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:44,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:50:44,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:50:44,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:44,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:44,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:44,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114639139] [2025-03-03 14:50:44,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114639139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:44,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:44,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832101861] [2025-03-03 14:50:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:44,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:44,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:44,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:44,422 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:44,529 INFO L93 Difference]: Finished difference Result 246 states and 372 transitions. [2025-03-03 14:50:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:50:44,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-03 14:50:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:44,531 INFO L225 Difference]: With dead ends: 246 [2025-03-03 14:50:44,531 INFO L226 Difference]: Without dead ends: 214 [2025-03-03 14:50:44,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:44,532 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 327 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:44,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 350 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-03 14:50:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 84. [2025-03-03 14:50:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-03-03 14:50:44,545 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 34 [2025-03-03 14:50:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-03-03 14:50:44,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-03-03 14:50:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:50:44,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:44,546 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] [2025-03-03 14:50:44,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:50:44,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:44,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash -744918371, now seen corresponding path program 1 times [2025-03-03 14:50:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:44,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700190395] [2025-03-03 14:50:44,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:44,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:50:44,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:50:44,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:44,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:44,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700190395] [2025-03-03 14:50:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700190395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:44,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:44,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725284491] [2025-03-03 14:50:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:44,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:44,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:44,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:44,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:44,629 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:44,653 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2025-03-03 14:50:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:50:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:44,655 INFO L225 Difference]: With dead ends: 197 [2025-03-03 14:50:44,655 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 14:50:44,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:44,655 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 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-03 14:50:44,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 14:50:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-03-03 14:50:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4538461538461538) internal successors, (189), 130 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2025-03-03 14:50:44,669 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 36 [2025-03-03 14:50:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:44,669 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2025-03-03 14:50:44,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2025-03-03 14:50:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:50:44,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:44,670 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] [2025-03-03 14:50:44,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:50:44,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:44,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash -712595136, now seen corresponding path program 1 times [2025-03-03 14:50:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:44,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212944443] [2025-03-03 14:50:44,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:44,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:50:44,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:50:44,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:44,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212944443] [2025-03-03 14:50:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212944443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:44,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:44,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:44,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589319536] [2025-03-03 14:50:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:44,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:44,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:44,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:44,814 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:44,859 INFO L93 Difference]: Finished difference Result 242 states and 357 transitions. [2025-03-03 14:50:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:50:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:44,860 INFO L225 Difference]: With dead ends: 242 [2025-03-03 14:50:44,860 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 14:50:44,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:50:44,861 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:44,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 160 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 14:50:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-03-03 14:50:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2025-03-03 14:50:44,866 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 36 [2025-03-03 14:50:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:44,866 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2025-03-03 14:50:44,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2025-03-03 14:50:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:50:44,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:44,867 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] [2025-03-03 14:50:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:50:44,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:44,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -585075003, now seen corresponding path program 1 times [2025-03-03 14:50:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966139599] [2025-03-03 14:50:44,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:50:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:50:44,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:44,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966139599] [2025-03-03 14:50:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966139599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607973516] [2025-03-03 14:50:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:45,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:45,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:45,008 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,027 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2025-03-03 14:50:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 14:50:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,028 INFO L225 Difference]: With dead ends: 139 [2025-03-03 14:50:45,028 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 14:50:45,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:45,029 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:45,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 14:50:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-03 14:50:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.411764705882353) internal successors, (192), 136 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-03 14:50:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2025-03-03 14:50:45,033 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 37 [2025-03-03 14:50:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:45,033 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2025-03-03 14:50:45,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2025-03-03 14:50:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:50:45,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:45,034 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] [2025-03-03 14:50:45,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:50:45,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1711257022, now seen corresponding path program 1 times [2025-03-03 14:50:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769898961] [2025-03-03 14:50:45,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:45,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:45,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 14:50:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:50:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:45,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769898961] [2025-03-03 14:50:45,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769898961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940432253] [2025-03-03 14:50:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:45,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,073 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,086 INFO L93 Difference]: Finished difference Result 351 states and 504 transitions. [2025-03-03 14:50:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 14:50:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,087 INFO L225 Difference]: With dead ends: 351 [2025-03-03 14:50:45,088 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 14:50:45,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,090 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 154 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-03 14:50:45,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 14:50:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-03 14:50:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4120171673819744) internal successors, (329), 233 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 329 transitions. [2025-03-03 14:50:45,100 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 329 transitions. Word has length 38 [2025-03-03 14:50:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:45,100 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 329 transitions. [2025-03-03 14:50:45,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 329 transitions. [2025-03-03 14:50:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:50:45,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:45,105 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] [2025-03-03 14:50:45,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:50:45,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:45,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1224538750, now seen corresponding path program 1 times [2025-03-03 14:50:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217825803] [2025-03-03 14:50:45,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:45,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 14:50:45,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:50:45,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:45,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217825803] [2025-03-03 14:50:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217825803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460464182] [2025-03-03 14:50:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:45,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,144 INFO L87 Difference]: Start difference. First operand 234 states and 329 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,157 INFO L93 Difference]: Finished difference Result 626 states and 887 transitions. [2025-03-03 14:50:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:45,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 14:50:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,160 INFO L225 Difference]: With dead ends: 626 [2025-03-03 14:50:45,160 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 14:50:45,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,162 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 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-03 14:50:45,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 14:50:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2025-03-03 14:50:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.389294403892944) internal successors, (571), 411 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 571 transitions. [2025-03-03 14:50:45,180 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 571 transitions. Word has length 38 [2025-03-03 14:50:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:45,180 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 571 transitions. [2025-03-03 14:50:45,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 571 transitions. [2025-03-03 14:50:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 14:50:45,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:45,182 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] [2025-03-03 14:50:45,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:50:45,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:45,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1452893534, now seen corresponding path program 1 times [2025-03-03 14:50:45,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:45,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170988654] [2025-03-03 14:50:45,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 14:50:45,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:50:45,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:45,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170988654] [2025-03-03 14:50:45,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170988654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452428443] [2025-03-03 14:50:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:45,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,236 INFO L87 Difference]: Start difference. First operand 412 states and 571 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,257 INFO L93 Difference]: Finished difference Result 835 states and 1177 transitions. [2025-03-03 14:50:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-03 14:50:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,260 INFO L225 Difference]: With dead ends: 835 [2025-03-03 14:50:45,261 INFO L226 Difference]: Without dead ends: 600 [2025-03-03 14:50:45,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,261 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 155 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-03 14:50:45,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-03 14:50:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2025-03-03 14:50:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3819095477386936) internal successors, (825), 597 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 825 transitions. [2025-03-03 14:50:45,282 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 825 transitions. Word has length 40 [2025-03-03 14:50:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:45,282 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 825 transitions. [2025-03-03 14:50:45,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 825 transitions. [2025-03-03 14:50:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:50:45,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:45,284 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] [2025-03-03 14:50:45,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:50:45,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:45,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:45,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1948030485, now seen corresponding path program 1 times [2025-03-03 14:50:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612067200] [2025-03-03 14:50:45,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:45,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:50:45,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:50:45,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:45,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:50:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612067200] [2025-03-03 14:50:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612067200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268800045] [2025-03-03 14:50:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:45,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:45,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:45,410 INFO L87 Difference]: Start difference. First operand 598 states and 825 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,501 INFO L93 Difference]: Finished difference Result 2454 states and 3405 transitions. [2025-03-03 14:50:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 14:50:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,509 INFO L225 Difference]: With dead ends: 2454 [2025-03-03 14:50:45,509 INFO L226 Difference]: Without dead ends: 1880 [2025-03-03 14:50:45,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:50:45,511 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 173 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:45,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 291 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-03-03 14:50:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1170. [2025-03-03 14:50:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.3798118049615056) internal successors, (1613), 1169 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1613 transitions. [2025-03-03 14:50:45,562 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1613 transitions. Word has length 53 [2025-03-03 14:50:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:45,562 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1613 transitions. [2025-03-03 14:50:45,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1613 transitions. [2025-03-03 14:50:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:50:45,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:45,563 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] [2025-03-03 14:50:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:50:45,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:45,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1461312213, now seen corresponding path program 1 times [2025-03-03 14:50:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761519458] [2025-03-03 14:50:45,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:45,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:50:45,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:50:45,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:50:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761519458] [2025-03-03 14:50:45,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761519458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113913983] [2025-03-03 14:50:45,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:45,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:45,660 INFO L87 Difference]: Start difference. First operand 1170 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,766 INFO L93 Difference]: Finished difference Result 3026 states and 4193 transitions. [2025-03-03 14:50:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:45,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 14:50:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,775 INFO L225 Difference]: With dead ends: 3026 [2025-03-03 14:50:45,775 INFO L226 Difference]: Without dead ends: 2452 [2025-03-03 14:50:45,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:50:45,777 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 177 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:45,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 278 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-03 14:50:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2030. [2025-03-03 14:50:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.3725973385904386) internal successors, (2785), 2029 states have internal predecessors, (2785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2785 transitions. [2025-03-03 14:50:45,835 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2785 transitions. Word has length 53 [2025-03-03 14:50:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:45,836 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2785 transitions. [2025-03-03 14:50:45,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2785 transitions. [2025-03-03 14:50:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:50:45,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:45,837 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] [2025-03-03 14:50:45,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:50:45,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:45,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash 604231475, now seen corresponding path program 1 times [2025-03-03 14:50:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798864186] [2025-03-03 14:50:45,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:45,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:50:45,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:50:45,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798864186] [2025-03-03 14:50:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798864186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690709864] [2025-03-03 14:50:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:45,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,897 INFO L87 Difference]: Start difference. First operand 2030 states and 2785 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,929 INFO L93 Difference]: Finished difference Result 3506 states and 4848 transitions. [2025-03-03 14:50:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:45,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 14:50:45,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,934 INFO L225 Difference]: With dead ends: 3506 [2025-03-03 14:50:45,934 INFO L226 Difference]: Without dead ends: 1500 [2025-03-03 14:50:45,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,936 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 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-03 14:50:45,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-03-03 14:50:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1498. [2025-03-03 14:50:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1497 states have (on average 1.3740814963259853) internal successors, (2057), 1497 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2057 transitions. [2025-03-03 14:50:46,001 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2057 transitions. Word has length 55 [2025-03-03 14:50:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:46,001 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2057 transitions. [2025-03-03 14:50:46,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2057 transitions. [2025-03-03 14:50:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:50:46,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:46,002 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] [2025-03-03 14:50:46,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:50:46,002 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:46,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1358924789, now seen corresponding path program 1 times [2025-03-03 14:50:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:46,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443954106] [2025-03-03 14:50:46,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:46,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:50:46,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:50:46,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:46,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:50:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:46,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443954106] [2025-03-03 14:50:46,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443954106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:46,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117020423] [2025-03-03 14:50:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:46,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:46,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:46,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:46,078 INFO L87 Difference]: Start difference. First operand 1498 states and 2057 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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-03 14:50:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:46,157 INFO L93 Difference]: Finished difference Result 2754 states and 3813 transitions. [2025-03-03 14:50:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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 55 [2025-03-03 14:50:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:46,165 INFO L225 Difference]: With dead ends: 2754 [2025-03-03 14:50:46,165 INFO L226 Difference]: Without dead ends: 2336 [2025-03-03 14:50:46,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:50:46,167 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 173 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:46,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 296 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-03 14:50:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1914. [2025-03-03 14:50:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.3763721902770518) internal successors, (2633), 1913 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2633 transitions. [2025-03-03 14:50:46,227 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2633 transitions. Word has length 55 [2025-03-03 14:50:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:46,227 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2633 transitions. [2025-03-03 14:50:46,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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-03 14:50:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2633 transitions. [2025-03-03 14:50:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:50:46,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:46,229 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] [2025-03-03 14:50:46,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:50:46,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:46,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash 968103256, now seen corresponding path program 1 times [2025-03-03 14:50:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:46,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333744119] [2025-03-03 14:50:46,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:46,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:50:46,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:50:46,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:46,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333744119] [2025-03-03 14:50:46,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333744119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:46,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:46,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869359216] [2025-03-03 14:50:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:46,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:46,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:46,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:46,302 INFO L87 Difference]: Start difference. First operand 1914 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-03 14:50:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:46,332 INFO L93 Difference]: Finished difference Result 2854 states and 3931 transitions. [2025-03-03 14:50:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:46,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 56 [2025-03-03 14:50:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:46,335 INFO L225 Difference]: With dead ends: 2854 [2025-03-03 14:50:46,335 INFO L226 Difference]: Without dead ends: 980 [2025-03-03 14:50:46,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:46,338 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 138 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-03 14:50:46,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-03-03 14:50:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 978. [2025-03-03 14:50:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 1.3500511770726715) internal successors, (1319), 977 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1319 transitions. [2025-03-03 14:50:46,368 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1319 transitions. Word has length 56 [2025-03-03 14:50:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:46,368 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1319 transitions. [2025-03-03 14:50:46,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-03 14:50:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1319 transitions. [2025-03-03 14:50:46,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 14:50:46,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:46,369 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] [2025-03-03 14:50:46,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:50:46,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:46,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash -937467809, now seen corresponding path program 1 times [2025-03-03 14:50:46,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:46,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119004414] [2025-03-03 14:50:46,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 14:50:46,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 14:50:46,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:46,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119004414] [2025-03-03 14:50:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119004414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:46,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:46,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784625718] [2025-03-03 14:50:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:46,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:46,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:46,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:46,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:46,437 INFO L87 Difference]: Start difference. First operand 978 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-03 14:50:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:46,458 INFO L93 Difference]: Finished difference Result 1450 states and 1960 transitions. [2025-03-03 14:50:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:46,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 58 [2025-03-03 14:50:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:46,460 INFO L225 Difference]: With dead ends: 1450 [2025-03-03 14:50:46,460 INFO L226 Difference]: Without dead ends: 512 [2025-03-03 14:50:46,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:46,461 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 26 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 123 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-03 14:50:46,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-03 14:50:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2025-03-03 14:50:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.3182711198428292) internal successors, (671), 509 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 671 transitions. [2025-03-03 14:50:46,478 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 671 transitions. Word has length 58 [2025-03-03 14:50:46,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:46,479 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 671 transitions. [2025-03-03 14:50:46,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-03 14:50:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 671 transitions. [2025-03-03 14:50:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:50:46,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:46,480 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] [2025-03-03 14:50:46,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:50:46,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:46,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1458136198, now seen corresponding path program 1 times [2025-03-03 14:50:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:46,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210374209] [2025-03-03 14:50:46,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:46,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:50:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:50:46,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210374209] [2025-03-03 14:50:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210374209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144281594] [2025-03-03 14:50:47,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:47,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:47,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:47,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:47,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:50:48,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:50:48,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:50:48,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:48,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:48,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:50:48,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:50:48,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:50:48,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144281594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:48,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:48,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-03-03 14:50:48,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096173601] [2025-03-03 14:50:48,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:48,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 14:50:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:48,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 14:50:48,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:50:48,407 INFO L87 Difference]: Start difference. First operand 510 states and 671 transitions. Second operand has 19 states, 19 states have (on average 8.631578947368421) internal successors, (164), 19 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:51,266 INFO L93 Difference]: Finished difference Result 2719 states and 3570 transitions. [2025-03-03 14:50:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 14:50:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.631578947368421) internal successors, (164), 19 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 14:50:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:51,272 INFO L225 Difference]: With dead ends: 2719 [2025-03-03 14:50:51,273 INFO L226 Difference]: Without dead ends: 2249 [2025-03-03 14:50:51,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=713, Invalid=2947, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 14:50:51,276 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 968 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:51,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 674 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:50:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2025-03-03 14:50:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2171. [2025-03-03 14:50:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 2170 states have (on average 1.252073732718894) internal successors, (2717), 2170 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2717 transitions. [2025-03-03 14:50:51,342 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2717 transitions. Word has length 60 [2025-03-03 14:50:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:51,342 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 2717 transitions. [2025-03-03 14:50:51,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.631578947368421) internal successors, (164), 19 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2717 transitions. [2025-03-03 14:50:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:50:51,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:51,346 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] [2025-03-03 14:50:51,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:50:51,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:50:51,547 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:51,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1820963702, now seen corresponding path program 1 times [2025-03-03 14:50:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885248092] [2025-03-03 14:50:51,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:51,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:51,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:51,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:51,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:51,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885248092] [2025-03-03 14:50:51,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885248092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767839167] [2025-03-03 14:50:51,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:51,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:51,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:51,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:51,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:50:51,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:51,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:51,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:50:51,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:52,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767839167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:52,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 14:50:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874719230] [2025-03-03 14:50:52,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:52,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:50:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:52,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:50:52,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:50:52,592 INFO L87 Difference]: Start difference. First operand 2171 states and 2717 transitions. Second operand has 23 states, 23 states have (on average 6.130434782608695) internal successors, (141), 22 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:52,925 INFO L93 Difference]: Finished difference Result 6127 states and 7721 transitions. [2025-03-03 14:50:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:50:52,925 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.130434782608695) internal successors, (141), 22 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 14:50:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:52,935 INFO L225 Difference]: With dead ends: 6127 [2025-03-03 14:50:52,935 INFO L226 Difference]: Without dead ends: 4273 [2025-03-03 14:50:52,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:50:52,937 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 845 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:52,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 348 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2025-03-03 14:50:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 4201. [2025-03-03 14:50:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4201 states, 4200 states have (on average 1.2345238095238096) internal successors, (5185), 4200 states have internal predecessors, (5185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 5185 transitions. [2025-03-03 14:50:53,035 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 5185 transitions. Word has length 61 [2025-03-03 14:50:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:53,035 INFO L471 AbstractCegarLoop]: Abstraction has 4201 states and 5185 transitions. [2025-03-03 14:50:53,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.130434782608695) internal successors, (141), 22 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 5185 transitions. [2025-03-03 14:50:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:50:53,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:53,036 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] [2025-03-03 14:50:53,043 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-03 14:50:53,240 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,SelfDestructingSolverStorable16 [2025-03-03 14:50:53,240 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 460773034, now seen corresponding path program 1 times [2025-03-03 14:50:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927932318] [2025-03-03 14:50:53,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:53,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:53,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:53,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:53,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:53,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:53,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927932318] [2025-03-03 14:50:53,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927932318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:53,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166804988] [2025-03-03 14:50:53,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:53,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:53,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:50:53,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:53,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:53,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:53,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:53,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:50:53,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:53,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166804988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:54,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 14:50:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630773646] [2025-03-03 14:50:54,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:54,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:50:54,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:54,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:50:54,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:50:54,281 INFO L87 Difference]: Start difference. First operand 4201 states and 5185 transitions. Second operand has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:54,675 INFO L93 Difference]: Finished difference Result 6914 states and 8602 transitions. [2025-03-03 14:50:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:50:54,676 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 14:50:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:54,685 INFO L225 Difference]: With dead ends: 6914 [2025-03-03 14:50:54,685 INFO L226 Difference]: Without dead ends: 4391 [2025-03-03 14:50:54,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:50:54,688 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 460 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:54,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 506 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:50:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4391 states. [2025-03-03 14:50:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4391 to 4293. [2025-03-03 14:50:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4293 states, 4292 states have (on average 1.2264678471575023) internal successors, (5264), 4292 states have internal predecessors, (5264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5264 transitions. [2025-03-03 14:50:54,782 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5264 transitions. Word has length 61 [2025-03-03 14:50:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:54,782 INFO L471 AbstractCegarLoop]: Abstraction has 4293 states and 5264 transitions. [2025-03-03 14:50:54,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5264 transitions. [2025-03-03 14:50:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:50:54,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:54,783 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] [2025-03-03 14:50:54,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:50:54,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:50:54,987 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:54,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1546602698, now seen corresponding path program 1 times [2025-03-03 14:50:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-03-03 14:50:54,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:54,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:55,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:55,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:55,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:55,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-03-03 14:50:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929348154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769550457] [2025-03-03 14:50:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:55,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:55,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:55,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:50:55,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:50:55,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:50:55,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:55,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:55,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:50:55,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:55,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:55,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769550457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:55,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:55,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 14:50:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674015114] [2025-03-03 14:50:55,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:55,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:50:55,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:55,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:50:55,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:50:55,954 INFO L87 Difference]: Start difference. First operand 4293 states and 5264 transitions. Second operand has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 22 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:56,280 INFO L93 Difference]: Finished difference Result 9096 states and 11216 transitions. [2025-03-03 14:50:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:50:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 22 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 14:50:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:56,297 INFO L225 Difference]: With dead ends: 9096 [2025-03-03 14:50:56,298 INFO L226 Difference]: Without dead ends: 5458 [2025-03-03 14:50:56,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:50:56,301 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 671 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:56,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 431 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2025-03-03 14:50:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 5454. [2025-03-03 14:50:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5454 states, 5453 states have (on average 1.2259306803594352) internal successors, (6685), 5453 states have internal predecessors, (6685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5454 states to 5454 states and 6685 transitions. [2025-03-03 14:50:56,461 INFO L78 Accepts]: Start accepts. Automaton has 5454 states and 6685 transitions. Word has length 61 [2025-03-03 14:50:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:56,461 INFO L471 AbstractCegarLoop]: Abstraction has 5454 states and 6685 transitions. [2025-03-03 14:50:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 22 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5454 states and 6685 transitions. [2025-03-03 14:50:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:50:56,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:56,462 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] [2025-03-03 14:50:56,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:50:56,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:56,663 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:56,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1274136387, now seen corresponding path program 1 times [2025-03-03 14:50:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:56,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834931282] [2025-03-03 14:50:56,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:56,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:50:56,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:50:56,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:56,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834931282] [2025-03-03 14:50:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834931282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286612965] [2025-03-03 14:50:57,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:57,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:57,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:57,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:57,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:50:57,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:50:57,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:50:57,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:57,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:57,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 14:50:57,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:59,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286612965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:00,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:00,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 14] total 48 [2025-03-03 14:51:00,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400760796] [2025-03-03 14:51:00,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:00,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 14:51:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:00,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 14:51:00,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 14:51:00,496 INFO L87 Difference]: Start difference. First operand 5454 states and 6685 transitions. Second operand has 48 states, 48 states have (on average 3.5416666666666665) internal successors, (170), 48 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:19,006 INFO L93 Difference]: Finished difference Result 14880 states and 18365 transitions. [2025-03-03 14:51:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2025-03-03 14:51:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.5416666666666665) internal successors, (170), 48 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 14:51:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:19,021 INFO L225 Difference]: With dead ends: 14880 [2025-03-03 14:51:19,021 INFO L226 Difference]: Without dead ends: 10816 [2025-03-03 14:51:19,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16413 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=7561, Invalid=36749, Unknown=0, NotChecked=0, Total=44310 [2025-03-03 14:51:19,030 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 3703 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3703 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 3670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:19,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3703 Valid, 3356 Invalid, 3670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 3539 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 14:51:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2025-03-03 14:51:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 4252. [2025-03-03 14:51:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4252 states, 4251 states have (on average 1.2361797224182545) internal successors, (5255), 4251 states have internal predecessors, (5255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 5255 transitions. [2025-03-03 14:51:19,173 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 5255 transitions. Word has length 62 [2025-03-03 14:51:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:19,173 INFO L471 AbstractCegarLoop]: Abstraction has 4252 states and 5255 transitions. [2025-03-03 14:51:19,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.5416666666666665) internal successors, (170), 48 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 5255 transitions. [2025-03-03 14:51:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:51:19,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:19,174 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] [2025-03-03 14:51:19,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:19,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:19,374 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:19,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash -464995607, now seen corresponding path program 1 times [2025-03-03 14:51:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:19,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326592241] [2025-03-03 14:51:19,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:19,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:19,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:51:19,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:51:19,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:20,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:20,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326592241] [2025-03-03 14:51:20,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326592241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:20,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910096078] [2025-03-03 14:51:20,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:20,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:20,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:20,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:20,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:51:20,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:51:20,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:51:20,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:20,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:20,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 14:51:20,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:21,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:21,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910096078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:21,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:21,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 44 [2025-03-03 14:51:21,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846565101] [2025-03-03 14:51:21,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:21,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 14:51:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:21,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 14:51:21,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 14:51:21,913 INFO L87 Difference]: Start difference. First operand 4252 states and 5255 transitions. Second operand has 44 states, 44 states have (on average 3.75) internal successors, (165), 44 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:24,362 INFO L93 Difference]: Finished difference Result 8079 states and 10026 transitions. [2025-03-03 14:51:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 14:51:24,363 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.75) internal successors, (165), 44 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 14:51:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:24,371 INFO L225 Difference]: With dead ends: 8079 [2025-03-03 14:51:24,371 INFO L226 Difference]: Without dead ends: 5707 [2025-03-03 14:51:24,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1219, Invalid=5587, Unknown=0, NotChecked=0, Total=6806 [2025-03-03 14:51:24,375 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1101 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:24,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1247 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 14:51:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2025-03-03 14:51:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 4263. [2025-03-03 14:51:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 4262 states have (on average 1.2358047864852182) internal successors, (5267), 4262 states have internal predecessors, (5267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 5267 transitions. [2025-03-03 14:51:24,517 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 5267 transitions. Word has length 63 [2025-03-03 14:51:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 5267 transitions. [2025-03-03 14:51:24,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.75) internal successors, (165), 44 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 5267 transitions. [2025-03-03 14:51:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:51:24,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,518 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] [2025-03-03 14:51:24,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:51:24,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:24,719 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash 286721313, now seen corresponding path program 1 times [2025-03-03 14:51:24,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082064840] [2025-03-03 14:51:24,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:24,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:24,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:25,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:25,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082064840] [2025-03-03 14:51:25,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082064840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:25,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730190027] [2025-03-03 14:51:25,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:25,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:25,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:25,097 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:25,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:51:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:51:25,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:51:25,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:25,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:25,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:51:25,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:25,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730190027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:26,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 37 [2025-03-03 14:51:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99044654] [2025-03-03 14:51:26,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 14:51:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 14:51:26,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 14:51:26,486 INFO L87 Difference]: Start difference. First operand 4263 states and 5267 transitions. Second operand has 37 states, 37 states have (on average 4.243243243243243) internal successors, (157), 37 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:27,458 INFO L93 Difference]: Finished difference Result 5987 states and 7422 transitions. [2025-03-03 14:51:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 14:51:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.243243243243243) internal successors, (157), 37 states have internal predecessors, (157), 0 states have call successors, (0), 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-03 14:51:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:27,467 INFO L225 Difference]: With dead ends: 5987 [2025-03-03 14:51:27,467 INFO L226 Difference]: Without dead ends: 4053 [2025-03-03 14:51:27,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=2400, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 14:51:27,470 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 652 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:27,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 591 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:51:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2025-03-03 14:51:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 4052. [2025-03-03 14:51:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4052 states, 4051 states have (on average 1.2379659343372007) internal successors, (5015), 4051 states have internal predecessors, (5015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 5015 transitions. [2025-03-03 14:51:27,605 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 5015 transitions. Word has length 64 [2025-03-03 14:51:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:27,605 INFO L471 AbstractCegarLoop]: Abstraction has 4052 states and 5015 transitions. [2025-03-03 14:51:27,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.243243243243243) internal successors, (157), 37 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 5015 transitions. [2025-03-03 14:51:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:51:27,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:27,607 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:27,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:27,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:27,811 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:27,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 612010492, now seen corresponding path program 1 times [2025-03-03 14:51:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251497964] [2025-03-03 14:51:27,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:27,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:51:27,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:51:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251497964] [2025-03-03 14:51:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251497964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697642458] [2025-03-03 14:51:28,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:28,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:28,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:28,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:28,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:51:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:51:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:51:28,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:28,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:28,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-03 14:51:28,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:30,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697642458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:34,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:34,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 25] total 61 [2025-03-03 14:51:34,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160413256] [2025-03-03 14:51:34,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:34,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-03 14:51:34,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:34,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-03 14:51:34,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3378, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 14:51:34,106 INFO L87 Difference]: Start difference. First operand 4052 states and 5015 transitions. Second operand has 61 states, 61 states have (on average 4.770491803278689) internal successors, (291), 61 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)