./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.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 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:09:32,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:09:32,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:09:32,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:09:32,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:09:32,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:09:32,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:09:32,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:09:32,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:09:32,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:09:32,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:09:32,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:09:32,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:09:32,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:09:32,931 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:09:32,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:09:32,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:09:32,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:09:32,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:09:32,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:09:32,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:09:32,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:09:32,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:09:32,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:09:32,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:09:32,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:09:32,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:09:32,934 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 -> 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 [2025-03-16 19:09:33,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:09:33,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:09:33,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:09:33,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:09:33,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:09:33,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2025-03-16 19:09:34,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba258abd/676cc20060454cbea1be887ecc4c7884/FLAG9aabb0657 [2025-03-16 19:09:34,499 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:09:34,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2025-03-16 19:09:34,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba258abd/676cc20060454cbea1be887ecc4c7884/FLAG9aabb0657 [2025-03-16 19:09:34,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ba258abd/676cc20060454cbea1be887ecc4c7884 [2025-03-16 19:09:34,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:09:34,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:09:34,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:34,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:09:34,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:09:34,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289c747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34, skipping insertion in model container [2025-03-16 19:09:34,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:09:34,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2025-03-16 19:09:34,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:34,716 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:09:34,757 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.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2025-03-16 19:09:34,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:34,773 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:09:34,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34 WrapperNode [2025-03-16 19:09:34,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:34,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:34,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:09:34,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:09:34,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,816 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 276 [2025-03-16 19:09:34,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:34,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:09:34,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:09:34,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:09:34,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:09:34,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:09:34,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:09:34,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:09:34,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:09:34,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (1/1) ... [2025-03-16 19:09:34,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:09:34,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:34,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:09:34,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:09:34,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:09:34,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:09:34,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:09:34,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:09:34,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:09:34,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:09:35,214 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-16 19:09:35,215 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:09:35,223 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:09:35,224 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:09:35,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:35 BoogieIcfgContainer [2025-03-16 19:09:35,225 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:09:35,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:09:35,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:09:35,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:09:35,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:09:34" (1/3) ... [2025-03-16 19:09:35,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b01d0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:35, skipping insertion in model container [2025-03-16 19:09:35,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:34" (2/3) ... [2025-03-16 19:09:35,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b01d0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:35, skipping insertion in model container [2025-03-16 19:09:35,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:35" (3/3) ... [2025-03-16 19:09:35,233 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2025-03-16 19:09:35,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:09:35,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c that has 1 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:09:35,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:09:35,302 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;@9629763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:09:35,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:09:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 63 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 19:09:35,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:35,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:35,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:35,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:35,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2017095885, now seen corresponding path program 1 times [2025-03-16 19:09:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969469054] [2025-03-16 19:09:35,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:35,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:35,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 19:09:35,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 19:09:35,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:35,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:35,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:35,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969469054] [2025-03-16 19:09:35,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969469054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:35,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:35,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:09:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527537286] [2025-03-16 19:09:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:35,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:09:35,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:35,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:09:35,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:09:35,506 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 63 states have internal predecessors, (110), 0 states have call successors, (0), 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.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:35,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:35,521 INFO L93 Difference]: Finished difference Result 102 states and 170 transitions. [2025-03-16 19:09:35,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:09:35,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-16 19:09:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:35,529 INFO L225 Difference]: With dead ends: 102 [2025-03-16 19:09:35,529 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 19:09:35,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:09:35,534 INFO L435 NwaCegarLoop]: 108 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, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:35,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 19:09:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-16 19:09:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 61 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 106 transitions. [2025-03-16 19:09:35,567 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 106 transitions. Word has length 18 [2025-03-16 19:09:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:35,568 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 106 transitions. [2025-03-16 19:09:35,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 106 transitions. [2025-03-16 19:09:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 19:09:35,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:35,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:35,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:09:35,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash -770319602, now seen corresponding path program 1 times [2025-03-16 19:09:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785377550] [2025-03-16 19:09:35,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:35,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 19:09:35,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 19:09:35,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:35,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785377550] [2025-03-16 19:09:35,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785377550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:35,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:35,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:09:35,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756067365] [2025-03-16 19:09:35,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:09:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:35,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:09:35,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:35,734 INFO L87 Difference]: Start difference. First operand 62 states and 106 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:35,801 INFO L93 Difference]: Finished difference Result 135 states and 221 transitions. [2025-03-16 19:09:35,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:09:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-16 19:09:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:35,802 INFO L225 Difference]: With dead ends: 135 [2025-03-16 19:09:35,803 INFO L226 Difference]: Without dead ends: 97 [2025-03-16 19:09:35,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:35,804 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 55 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:35,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 281 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-16 19:09:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 62. [2025-03-16 19:09:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2025-03-16 19:09:35,811 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 18 [2025-03-16 19:09:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:35,811 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-03-16 19:09:35,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2025-03-16 19:09:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:09:35,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:35,813 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-16 19:09:35,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:09:35,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1237210952, now seen corresponding path program 1 times [2025-03-16 19:09:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:35,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117275451] [2025-03-16 19:09:35,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:35,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:09:35,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:09:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117275451] [2025-03-16 19:09:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117275451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:36,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:36,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783943801] [2025-03-16 19:09:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:36,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:36,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:36,013 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-16 19:09:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:36,192 INFO L93 Difference]: Finished difference Result 342 states and 531 transitions. [2025-03-16 19:09:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:09:36,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-16 19:09:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:36,195 INFO L225 Difference]: With dead ends: 342 [2025-03-16 19:09:36,195 INFO L226 Difference]: Without dead ends: 307 [2025-03-16 19:09:36,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:09:36,196 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 450 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:36,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 851 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-16 19:09:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 95. [2025-03-16 19:09:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.446808510638298) internal successors, (136), 94 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2025-03-16 19:09:36,204 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 40 [2025-03-16 19:09:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2025-03-16 19:09:36,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-16 19:09:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2025-03-16 19:09:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:09:36,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:36,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:36,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:09:36,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:36,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash 782355613, now seen corresponding path program 1 times [2025-03-16 19:09:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313277669] [2025-03-16 19:09:36,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:36,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:09:36,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:09:36,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:36,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:36,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313277669] [2025-03-16 19:09:36,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313277669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:36,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:36,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:36,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781961975] [2025-03-16 19:09:36,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:36,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:36,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:36,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:36,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:36,259 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:36,274 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2025-03-16 19:09:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-16 19:09:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:36,277 INFO L225 Difference]: With dead ends: 220 [2025-03-16 19:09:36,278 INFO L226 Difference]: Without dead ends: 152 [2025-03-16 19:09:36,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:36,278 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:36,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 132 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-16 19:09:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2025-03-16 19:09:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 149 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2025-03-16 19:09:36,291 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 42 [2025-03-16 19:09:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:36,291 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2025-03-16 19:09:36,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2025-03-16 19:09:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:09:36,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:36,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:36,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:09:36,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:36,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 783398298, now seen corresponding path program 1 times [2025-03-16 19:09:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066479274] [2025-03-16 19:09:36,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:36,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:09:36,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:09:36,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:36,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:36,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066479274] [2025-03-16 19:09:36,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066479274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:36,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:36,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596153582] [2025-03-16 19:09:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:36,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:36,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:36,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:36,504 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:36,580 INFO L93 Difference]: Finished difference Result 275 states and 418 transitions. [2025-03-16 19:09:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:36,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-16 19:09:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:36,581 INFO L225 Difference]: With dead ends: 275 [2025-03-16 19:09:36,581 INFO L226 Difference]: Without dead ends: 152 [2025-03-16 19:09:36,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:36,582 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 126 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:36,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 233 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-16 19:09:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2025-03-16 19:09:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2025-03-16 19:09:36,593 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 42 [2025-03-16 19:09:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:36,593 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2025-03-16 19:09:36,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2025-03-16 19:09:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 19:09:36,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:36,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:36,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:09:36,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:36,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1483471479, now seen corresponding path program 1 times [2025-03-16 19:09:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131122648] [2025-03-16 19:09:36,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:36,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 19:09:36,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:09:36,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:36,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131122648] [2025-03-16 19:09:36,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131122648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:36,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:36,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:09:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984585226] [2025-03-16 19:09:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:09:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:36,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:09:36,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:36,720 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:36,737 INFO L93 Difference]: Finished difference Result 156 states and 227 transitions. [2025-03-16 19:09:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:09:36,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 19:09:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:36,738 INFO L225 Difference]: With dead ends: 156 [2025-03-16 19:09:36,738 INFO L226 Difference]: Without dead ends: 154 [2025-03-16 19:09:36,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:36,739 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:36,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-16 19:09:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-16 19:09:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.457516339869281) internal successors, (223), 153 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 223 transitions. [2025-03-16 19:09:36,744 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 223 transitions. Word has length 43 [2025-03-16 19:09:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:36,744 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 223 transitions. [2025-03-16 19:09:36,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 223 transitions. [2025-03-16 19:09:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:36,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:36,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:36,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:09:36,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2069786204, now seen corresponding path program 1 times [2025-03-16 19:09:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048259054] [2025-03-16 19:09:36,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:36,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:36,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:36,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:36,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:36,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048259054] [2025-03-16 19:09:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048259054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:36,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384268921] [2025-03-16 19:09:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:36,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:36,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:36,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:36,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:36,798 INFO L87 Difference]: Start difference. First operand 154 states and 223 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:36,819 INFO L93 Difference]: Finished difference Result 292 states and 436 transitions. [2025-03-16 19:09:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:09:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:36,820 INFO L225 Difference]: With dead ends: 292 [2025-03-16 19:09:36,820 INFO L226 Difference]: Without dead ends: 220 [2025-03-16 19:09:36,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:36,821 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:36,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 181 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-16 19:09:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-03-16 19:09:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.4746543778801844) internal successors, (320), 217 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2025-03-16 19:09:36,833 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 44 [2025-03-16 19:09:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:36,834 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2025-03-16 19:09:36,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2025-03-16 19:09:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:36,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:36,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:36,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:09:36,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:36,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1401958052, now seen corresponding path program 1 times [2025-03-16 19:09:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913299361] [2025-03-16 19:09:36,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:36,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:36,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:36,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:36,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:36,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:36,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913299361] [2025-03-16 19:09:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913299361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:36,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:36,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361457708] [2025-03-16 19:09:36,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:36,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:36,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:36,886 INFO L87 Difference]: Start difference. First operand 218 states and 320 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:36,902 INFO L93 Difference]: Finished difference Result 572 states and 860 transitions. [2025-03-16 19:09:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:36,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:09:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:36,905 INFO L225 Difference]: With dead ends: 572 [2025-03-16 19:09:36,905 INFO L226 Difference]: Without dead ends: 383 [2025-03-16 19:09:36,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:36,906 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 44 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:36,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-16 19:09:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2025-03-16 19:09:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.4789473684210526) internal successors, (562), 380 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 562 transitions. [2025-03-16 19:09:36,924 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 562 transitions. Word has length 44 [2025-03-16 19:09:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:36,925 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 562 transitions. [2025-03-16 19:09:36,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 562 transitions. [2025-03-16 19:09:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:36,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:36,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:36,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:09:36,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:36,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1468140452, now seen corresponding path program 1 times [2025-03-16 19:09:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328613640] [2025-03-16 19:09:36,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:36,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:36,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:36,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328613640] [2025-03-16 19:09:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328613640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:36,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950448797] [2025-03-16 19:09:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:36,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:36,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:36,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:36,996 INFO L87 Difference]: Start difference. First operand 381 states and 562 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:37,012 INFO L93 Difference]: Finished difference Result 1037 states and 1544 transitions. [2025-03-16 19:09:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:37,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:09:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:37,015 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 19:09:37,015 INFO L226 Difference]: Without dead ends: 685 [2025-03-16 19:09:37,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:37,016 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 42 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:37,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 189 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-16 19:09:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 683. [2025-03-16 19:09:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.4633431085043989) internal successors, (998), 682 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 998 transitions. [2025-03-16 19:09:37,037 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 998 transitions. Word has length 44 [2025-03-16 19:09:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:37,038 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 998 transitions. [2025-03-16 19:09:37,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 998 transitions. [2025-03-16 19:09:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:37,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:37,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:37,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:09:37,039 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:37,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2017929380, now seen corresponding path program 1 times [2025-03-16 19:09:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509384048] [2025-03-16 19:09:37,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:37,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:37,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:37,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:37,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509384048] [2025-03-16 19:09:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509384048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692391689] [2025-03-16 19:09:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:37,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:37,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:37,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:37,090 INFO L87 Difference]: Start difference. First operand 683 states and 998 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:37,113 INFO L93 Difference]: Finished difference Result 1895 states and 2768 transitions. [2025-03-16 19:09:37,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:37,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:09:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:37,118 INFO L225 Difference]: With dead ends: 1895 [2025-03-16 19:09:37,118 INFO L226 Difference]: Without dead ends: 1241 [2025-03-16 19:09:37,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:37,119 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:37,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:37,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-16 19:09:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-03-16 19:09:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.432956381260097) internal successors, (1774), 1238 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1774 transitions. [2025-03-16 19:09:37,159 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1774 transitions. Word has length 44 [2025-03-16 19:09:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:37,159 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1774 transitions. [2025-03-16 19:09:37,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1774 transitions. [2025-03-16 19:09:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:37,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:37,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:09:37,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:37,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1475985865, now seen corresponding path program 1 times [2025-03-16 19:09:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587102723] [2025-03-16 19:09:37,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:37,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:37,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:37,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:37,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:37,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587102723] [2025-03-16 19:09:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587102723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:37,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:37,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355821424] [2025-03-16 19:09:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:37,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:37,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:37,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:37,287 INFO L87 Difference]: Start difference. First operand 1239 states and 1774 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:37,447 INFO L93 Difference]: Finished difference Result 6001 states and 8635 transitions. [2025-03-16 19:09:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:09:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:37,464 INFO L225 Difference]: With dead ends: 6001 [2025-03-16 19:09:37,464 INFO L226 Difference]: Without dead ends: 5135 [2025-03-16 19:09:37,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:37,470 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 321 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:37,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 499 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2025-03-16 19:09:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 2279. [2025-03-16 19:09:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.4284460052677788) internal successors, (3254), 2278 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3254 transitions. [2025-03-16 19:09:37,588 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3254 transitions. Word has length 60 [2025-03-16 19:09:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:37,588 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3254 transitions. [2025-03-16 19:09:37,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3254 transitions. [2025-03-16 19:09:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:37,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:37,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:37,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:09:37,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1995758391, now seen corresponding path program 1 times [2025-03-16 19:09:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377880995] [2025-03-16 19:09:37,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:37,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:37,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:37,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:37,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:09:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377880995] [2025-03-16 19:09:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377880995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:37,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:37,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718551382] [2025-03-16 19:09:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:37,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:37,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:37,702 INFO L87 Difference]: Start difference. First operand 2279 states and 3254 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:37,878 INFO L93 Difference]: Finished difference Result 7209 states and 10363 transitions. [2025-03-16 19:09:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:09:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:37,897 INFO L225 Difference]: With dead ends: 7209 [2025-03-16 19:09:37,897 INFO L226 Difference]: Without dead ends: 5999 [2025-03-16 19:09:37,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:37,901 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 325 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:37,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 463 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2025-03-16 19:09:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3919. [2025-03-16 19:09:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.4247064828994385) internal successors, (5582), 3918 states have internal predecessors, (5582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 5582 transitions. [2025-03-16 19:09:38,039 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 5582 transitions. Word has length 60 [2025-03-16 19:09:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:38,039 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 5582 transitions. [2025-03-16 19:09:38,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 5582 transitions. [2025-03-16 19:09:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:38,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:38,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:38,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:09:38,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:38,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2061940791, now seen corresponding path program 1 times [2025-03-16 19:09:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813731732] [2025-03-16 19:09:38,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:38,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:38,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:38,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:09:38,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813731732] [2025-03-16 19:09:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813731732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:38,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750019095] [2025-03-16 19:09:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:38,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:38,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:38,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:38,139 INFO L87 Difference]: Start difference. First operand 3919 states and 5582 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:38,308 INFO L93 Difference]: Finished difference Result 8417 states and 12083 transitions. [2025-03-16 19:09:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:38,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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 60 [2025-03-16 19:09:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:38,328 INFO L225 Difference]: With dead ends: 8417 [2025-03-16 19:09:38,328 INFO L226 Difference]: Without dead ends: 7207 [2025-03-16 19:09:38,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:38,332 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 344 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:38,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 461 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2025-03-16 19:09:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 5127. [2025-03-16 19:09:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 5126 states have (on average 1.424502536090519) internal successors, (7302), 5126 states have internal predecessors, (7302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 7302 transitions. [2025-03-16 19:09:38,474 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 7302 transitions. Word has length 60 [2025-03-16 19:09:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:38,475 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 7302 transitions. [2025-03-16 19:09:38,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 7302 transitions. [2025-03-16 19:09:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:38,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:38,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:38,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:09:38,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:38,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1683237577, now seen corresponding path program 1 times [2025-03-16 19:09:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:38,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233267369] [2025-03-16 19:09:38,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:38,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:38,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:38,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:38,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:09:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:38,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233267369] [2025-03-16 19:09:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233267369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:38,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94299245] [2025-03-16 19:09:38,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:38,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:38,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:38,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:38,560 INFO L87 Difference]: Start difference. First operand 5127 states and 7302 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:38,760 INFO L93 Difference]: Finished difference Result 9625 states and 13803 transitions. [2025-03-16 19:09:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:38,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:09:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:38,788 INFO L225 Difference]: With dead ends: 9625 [2025-03-16 19:09:38,789 INFO L226 Difference]: Without dead ends: 8415 [2025-03-16 19:09:38,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:38,793 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 335 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:38,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 477 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2025-03-16 19:09:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 6335. [2025-03-16 19:09:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 6334 states have (on average 1.4243763814335333) internal successors, (9022), 6334 states have internal predecessors, (9022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9022 transitions. [2025-03-16 19:09:38,978 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9022 transitions. Word has length 60 [2025-03-16 19:09:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:38,979 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9022 transitions. [2025-03-16 19:09:38,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9022 transitions. [2025-03-16 19:09:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:09:38,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:38,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:38,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:09:38,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash 74907570, now seen corresponding path program 1 times [2025-03-16 19:09:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:38,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444424540] [2025-03-16 19:09:38,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:38,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:09:39,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:09:39,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444424540] [2025-03-16 19:09:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444424540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627408930] [2025-03-16 19:09:39,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,067 INFO L87 Difference]: Start difference. First operand 6335 states and 9022 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,182 INFO L93 Difference]: Finished difference Result 12643 states and 18016 transitions. [2025-03-16 19:09:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 19:09:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,193 INFO L225 Difference]: With dead ends: 12643 [2025-03-16 19:09:39,193 INFO L226 Difference]: Without dead ends: 6337 [2025-03-16 19:09:39,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,200 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 181 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2025-03-16 19:09:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6335. [2025-03-16 19:09:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 6334 states have (on average 1.4047994947900222) internal successors, (8898), 6334 states have internal predecessors, (8898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 8898 transitions. [2025-03-16 19:09:39,362 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 8898 transitions. Word has length 61 [2025-03-16 19:09:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,363 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 8898 transitions. [2025-03-16 19:09:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 8898 transitions. [2025-03-16 19:09:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:09:39,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:09:39,365 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1963749739, now seen corresponding path program 1 times [2025-03-16 19:09:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958966343] [2025-03-16 19:09:39,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:09:39,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:09:39,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958966343] [2025-03-16 19:09:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958966343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239149103] [2025-03-16 19:09:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,421 INFO L87 Difference]: Start difference. First operand 6335 states and 8898 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,461 INFO L93 Difference]: Finished difference Result 8731 states and 12305 transitions. [2025-03-16 19:09:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:09:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,465 INFO L225 Difference]: With dead ends: 8731 [2025-03-16 19:09:39,466 INFO L226 Difference]: Without dead ends: 2425 [2025-03-16 19:09:39,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,470 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2025-03-16 19:09:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2418. [2025-03-16 19:09:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2417 states have (on average 1.4004964832436906) internal successors, (3385), 2417 states have internal predecessors, (3385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3385 transitions. [2025-03-16 19:09:39,512 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3385 transitions. Word has length 62 [2025-03-16 19:09:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,512 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3385 transitions. [2025-03-16 19:09:39,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3385 transitions. [2025-03-16 19:09:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:09:39,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:09:39,514 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,515 INFO L85 PathProgramCache]: Analyzing trace with hash -899553077, now seen corresponding path program 1 times [2025-03-16 19:09:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834931282] [2025-03-16 19:09:39,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:09:39,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:09:39,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834931282] [2025-03-16 19:09:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834931282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718914069] [2025-03-16 19:09:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,598 INFO L87 Difference]: Start difference. First operand 2418 states and 3385 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,620 INFO L93 Difference]: Finished difference Result 3610 states and 5059 transitions. [2025-03-16 19:09:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:09:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,624 INFO L225 Difference]: With dead ends: 3610 [2025-03-16 19:09:39,624 INFO L226 Difference]: Without dead ends: 1232 [2025-03-16 19:09:39,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,626 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-03-16 19:09:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1230. [2025-03-16 19:09:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.3759153783563873) internal successors, (1691), 1229 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1691 transitions. [2025-03-16 19:09:39,653 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1691 transitions. Word has length 63 [2025-03-16 19:09:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,653 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1691 transitions. [2025-03-16 19:09:39,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1691 transitions. [2025-03-16 19:09:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:09:39,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:09:39,655 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1681800420, now seen corresponding path program 1 times [2025-03-16 19:09:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621075625] [2025-03-16 19:09:39,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:09:39,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:09:39,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621075625] [2025-03-16 19:09:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621075625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850248985] [2025-03-16 19:09:39,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,717 INFO L87 Difference]: Start difference. First operand 1230 states and 1691 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,732 INFO L93 Difference]: Finished difference Result 1828 states and 2518 transitions. [2025-03-16 19:09:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:09:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,733 INFO L225 Difference]: With dead ends: 1828 [2025-03-16 19:09:39,733 INFO L226 Difference]: Without dead ends: 638 [2025-03-16 19:09:39,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,735 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 30 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-16 19:09:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2025-03-16 19:09:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.3464566929133859) internal successors, (855), 635 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 855 transitions. [2025-03-16 19:09:39,747 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 855 transitions. Word has length 65 [2025-03-16 19:09:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,747 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 855 transitions. [2025-03-16 19:09:39,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 855 transitions. [2025-03-16 19:09:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:09:39,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:09:39,748 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1934593021, now seen corresponding path program 1 times [2025-03-16 19:09:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652071921] [2025-03-16 19:09:39,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:09:39,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:09:39,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652071921] [2025-03-16 19:09:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652071921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921532274] [2025-03-16 19:09:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:40,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:40,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:09:40,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:09:41,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:09:41,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:41,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:41,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:09:41,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:41,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921532274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:42,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:42,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-16 19:09:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904896613] [2025-03-16 19:09:42,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:42,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:09:42,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:42,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:09:42,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:09:42,138 INFO L87 Difference]: Start difference. First operand 636 states and 855 transitions. Second operand has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 25 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:43,752 INFO L93 Difference]: Finished difference Result 3174 states and 4336 transitions. [2025-03-16 19:09:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-16 19:09:43,752 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 25 states have internal predecessors, (175), 0 states have call successors, (0), 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 67 [2025-03-16 19:09:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:43,756 INFO L225 Difference]: With dead ends: 3174 [2025-03-16 19:09:43,756 INFO L226 Difference]: Without dead ends: 2578 [2025-03-16 19:09:43,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=599, Invalid=2941, Unknown=0, NotChecked=0, Total=3540 [2025-03-16 19:09:43,758 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 1133 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:43,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 1038 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:09:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-03-16 19:09:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2522. [2025-03-16 19:09:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2521 states have (on average 1.333201110670369) internal successors, (3361), 2521 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 3361 transitions. [2025-03-16 19:09:43,804 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 3361 transitions. Word has length 67 [2025-03-16 19:09:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:43,805 INFO L471 AbstractCegarLoop]: Abstraction has 2522 states and 3361 transitions. [2025-03-16 19:09:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 25 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3361 transitions. [2025-03-16 19:09:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:09:43,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:43,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:43,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:09:44,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:44,010 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:44,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash 452017339, now seen corresponding path program 1 times [2025-03-16 19:09:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:44,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139210902] [2025-03-16 19:09:44,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:44,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:09:44,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:09:44,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:44,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:45,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:45,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139210902] [2025-03-16 19:09:45,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139210902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:45,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445287833] [2025-03-16 19:09:45,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:45,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:45,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:45,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:45,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:09:45,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:09:45,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:09:45,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:45,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:45,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:09:45,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:45,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:45,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445287833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:45,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:45,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-16 19:09:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677525387] [2025-03-16 19:09:45,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:45,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:09:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:45,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:09:45,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:09:45,892 INFO L87 Difference]: Start difference. First operand 2522 states and 3361 transitions. Second operand has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:47,279 INFO L93 Difference]: Finished difference Result 7284 states and 9772 transitions. [2025-03-16 19:09:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 19:09:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:09:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:47,288 INFO L225 Difference]: With dead ends: 7284 [2025-03-16 19:09:47,288 INFO L226 Difference]: Without dead ends: 5586 [2025-03-16 19:09:47,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=610, Invalid=2470, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 19:09:47,293 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1172 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:47,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 710 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:09:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2025-03-16 19:09:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 5454. [2025-03-16 19:09:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5454 states, 5453 states have (on average 1.3167064001467081) internal successors, (7180), 5453 states have internal predecessors, (7180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5454 states to 5454 states and 7180 transitions. [2025-03-16 19:09:47,395 INFO L78 Accepts]: Start accepts. Automaton has 5454 states and 7180 transitions. Word has length 68 [2025-03-16 19:09:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:47,396 INFO L471 AbstractCegarLoop]: Abstraction has 5454 states and 7180 transitions. [2025-03-16 19:09:47,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5454 states and 7180 transitions. [2025-03-16 19:09:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:09:47,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:47,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:47,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:09:47,597 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,SelfDestructingSolverStorable19 [2025-03-16 19:09:47,598 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:47,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1487609221, now seen corresponding path program 1 times [2025-03-16 19:09:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:47,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363901004] [2025-03-16 19:09:47,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:47,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:09:47,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:09:47,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:47,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:48,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363901004] [2025-03-16 19:09:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363901004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104801615] [2025-03-16 19:09:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:48,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:48,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:48,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:48,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:09:48,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:09:48,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:09:48,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:48,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:48,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 19:09:48,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:49,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104801615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:50,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 32 [2025-03-16 19:09:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485623599] [2025-03-16 19:09:50,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:50,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 19:09:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:50,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 19:09:50,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:09:50,489 INFO L87 Difference]: Start difference. First operand 5454 states and 7180 transitions. Second operand has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:52,261 INFO L93 Difference]: Finished difference Result 14338 states and 18962 transitions. [2025-03-16 19:09:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 19:09:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:09:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:52,274 INFO L225 Difference]: With dead ends: 14338 [2025-03-16 19:09:52,274 INFO L226 Difference]: Without dead ends: 8924 [2025-03-16 19:09:52,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=784, Invalid=2876, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 19:09:52,280 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1538 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:52,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 902 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:09:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8924 states. [2025-03-16 19:09:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8924 to 8342. [2025-03-16 19:09:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8342 states, 8341 states have (on average 1.309914878311953) internal successors, (10926), 8341 states have internal predecessors, (10926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 10926 transitions. [2025-03-16 19:09:52,454 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 10926 transitions. Word has length 68 [2025-03-16 19:09:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:52,455 INFO L471 AbstractCegarLoop]: Abstraction has 8342 states and 10926 transitions. [2025-03-16 19:09:52,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.875) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 10926 transitions. [2025-03-16 19:09:52,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:09:52,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:52,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:52,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:09:52,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:52,661 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1321715582, now seen corresponding path program 1 times [2025-03-16 19:09:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:52,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975000211] [2025-03-16 19:09:52,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:52,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:09:52,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:09:52,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:52,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:52,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:52,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975000211] [2025-03-16 19:09:52,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975000211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:52,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001298931] [2025-03-16 19:09:52,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:52,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:52,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:52,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:52,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:09:53,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:09:53,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:09:53,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:53,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:53,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 19:09:53,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:53,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001298931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:54,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:54,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2025-03-16 19:09:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071417455] [2025-03-16 19:09:54,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:54,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:09:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:54,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:09:54,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:09:54,100 INFO L87 Difference]: Start difference. First operand 8342 states and 10926 transitions. Second operand has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:56,739 INFO L93 Difference]: Finished difference Result 25643 states and 33646 transitions. [2025-03-16 19:09:56,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-16 19:09:56,742 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:09:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:56,767 INFO L225 Difference]: With dead ends: 25643 [2025-03-16 19:09:56,767 INFO L226 Difference]: Without dead ends: 17341 [2025-03-16 19:09:56,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=998, Invalid=5164, Unknown=0, NotChecked=0, Total=6162 [2025-03-16 19:09:56,778 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1706 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:56,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2089 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:09:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17341 states. [2025-03-16 19:09:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17341 to 10132. [2025-03-16 19:09:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10132 states, 10131 states have (on average 1.310630737340835) internal successors, (13278), 10131 states have internal predecessors, (13278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 13278 transitions. [2025-03-16 19:09:57,059 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 13278 transitions. Word has length 69 [2025-03-16 19:09:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 10132 states and 13278 transitions. [2025-03-16 19:09:57,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.903225806451613) internal successors, (183), 30 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 13278 transitions. [2025-03-16 19:09:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:09:57,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:57,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:57,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 19:09:57,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:57,261 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2069883659, now seen corresponding path program 1 times [2025-03-16 19:09:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:57,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168688532] [2025-03-16 19:09:57,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:57,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:57,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:57,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168688532] [2025-03-16 19:09:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168688532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793569525] [2025-03-16 19:09:57,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:57,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:57,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:57,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:57,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:09:57,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:57,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:57,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:57,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:57,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 19:09:57,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:10:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:00,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793569525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:01,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 19] total 45 [2025-03-16 19:10:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223711902] [2025-03-16 19:10:01,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:01,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-16 19:10:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:01,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-16 19:10:01,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1867, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 19:10:01,916 INFO L87 Difference]: Start difference. First operand 10132 states and 13278 transitions. Second operand has 46 states, 46 states have (on average 4.173913043478261) internal successors, (192), 45 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:10:37,910 INFO L93 Difference]: Finished difference Result 40444 states and 53371 transitions. [2025-03-16 19:10:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2025-03-16 19:10:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.173913043478261) internal successors, (192), 45 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:10:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:10:37,948 INFO L225 Difference]: With dead ends: 40444 [2025-03-16 19:10:37,948 INFO L226 Difference]: Without dead ends: 34644 [2025-03-16 19:10:37,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38270 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=13850, Invalid=76450, Unknown=0, NotChecked=0, Total=90300 [2025-03-16 19:10:37,966 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 8036 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 4026 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8036 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 4186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 4026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:10:37,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8036 Valid, 2286 Invalid, 4186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 4026 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 19:10:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34644 states. [2025-03-16 19:10:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34644 to 11108. [2025-03-16 19:10:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11108 states, 11107 states have (on average 1.3069235617178356) internal successors, (14516), 11107 states have internal predecessors, (14516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11108 states to 11108 states and 14516 transitions. [2025-03-16 19:10:38,460 INFO L78 Accepts]: Start accepts. Automaton has 11108 states and 14516 transitions. Word has length 70 [2025-03-16 19:10:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:10:38,460 INFO L471 AbstractCegarLoop]: Abstraction has 11108 states and 14516 transitions. [2025-03-16 19:10:38,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.173913043478261) internal successors, (192), 45 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11108 states and 14516 transitions. [2025-03-16 19:10:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:10:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:10:38,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:10:38,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 19:10:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 19:10:38,661 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:10:38,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:10:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1482965833, now seen corresponding path program 1 times [2025-03-16 19:10:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:10:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537596010] [2025-03-16 19:10:38,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:10:38,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:10:38,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:10:38,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:38,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:10:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:10:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537596010] [2025-03-16 19:10:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537596010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:10:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885926955] [2025-03-16 19:10:38,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:10:38,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:10:38,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:10:38,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:10:38,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:10:38,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:38,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:38,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:10:38,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:10:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:38,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885926955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:39,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:39,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2025-03-16 19:10:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151377632] [2025-03-16 19:10:39,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:10:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:39,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:10:39,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:10:39,202 INFO L87 Difference]: Start difference. First operand 11108 states and 14516 transitions. Second operand has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 12 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:10:40,822 INFO L93 Difference]: Finished difference Result 46109 states and 59483 transitions. [2025-03-16 19:10:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:10:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 12 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:10:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:10:40,860 INFO L225 Difference]: With dead ends: 46109 [2025-03-16 19:10:40,860 INFO L226 Difference]: Without dead ends: 34573 [2025-03-16 19:10:40,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:10:40,871 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 363 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:10:40,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 777 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:10:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34573 states. [2025-03-16 19:10:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34573 to 31972. [2025-03-16 19:10:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31972 states, 31971 states have (on average 1.2640205185949767) internal successors, (40412), 31971 states have internal predecessors, (40412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31972 states to 31972 states and 40412 transitions. [2025-03-16 19:10:42,184 INFO L78 Accepts]: Start accepts. Automaton has 31972 states and 40412 transitions. Word has length 71 [2025-03-16 19:10:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:10:42,184 INFO L471 AbstractCegarLoop]: Abstraction has 31972 states and 40412 transitions. [2025-03-16 19:10:42,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.833333333333332) internal successors, (202), 12 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 31972 states and 40412 transitions. [2025-03-16 19:10:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:10:42,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:10:42,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:10:42,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 19:10:42,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:42,386 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:10:42,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:10:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1529277511, now seen corresponding path program 1 times [2025-03-16 19:10:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:10:42,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069723785] [2025-03-16 19:10:42,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:10:42,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:10:42,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:10:42,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:42,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:10:43,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069723785] [2025-03-16 19:10:43,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069723785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:10:43,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667817148] [2025-03-16 19:10:43,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:43,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:43,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:10:43,579 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-16 19:10:43,580 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-16 19:10:43,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:10:43,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:10:43,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:43,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:43,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-16 19:10:43,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:10:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:46,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:51,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667817148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:51,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:51,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 26] total 75 [2025-03-16 19:10:51,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362887744] [2025-03-16 19:10:51,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:51,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-03-16 19:10:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:51,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-03-16 19:10:51,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=5001, Unknown=0, NotChecked=0, Total=5550 [2025-03-16 19:10:51,454 INFO L87 Difference]: Start difference. First operand 31972 states and 40412 transitions. Second operand has 75 states, 75 states have (on average 2.6266666666666665) internal successors, (197), 75 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)