./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.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-var-start-time.4.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aba75d5c6112bb80051134ed7f98fd80207b53da5b894be601f1f010079e2e6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:08:06,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:08:06,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:08:06,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:08:06,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:08:06,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:08:06,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:08:06,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:08:06,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:08:06,885 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:08:06,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:08:06,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:08:06,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:08:06,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:08:06,887 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:08:06,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:08:06,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:08:06,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:08:06,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:08:06,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:08:06,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:08:06,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:08:06,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:08:06,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:08:06,889 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 -> aba75d5c6112bb80051134ed7f98fd80207b53da5b894be601f1f010079e2e6e [2025-03-16 19:08:07,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:08:07,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:08:07,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:08:07,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:08:07,147 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:08:07,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2025-03-16 19:08:08,350 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29484f0c/c7ebbe323612430781d325db073865a9/FLAG890409d97 [2025-03-16 19:08:08,588 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:08:08,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2025-03-16 19:08:08,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29484f0c/c7ebbe323612430781d325db073865a9/FLAG890409d97 [2025-03-16 19:08:08,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29484f0c/c7ebbe323612430781d325db073865a9 [2025-03-16 19:08:08,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:08:08,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:08:08,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:08:08,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:08:08,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:08:08,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:08:08" (1/1) ... [2025-03-16 19:08:08,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77041b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:08, skipping insertion in model container [2025-03-16 19:08:08,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:08:08" (1/1) ... [2025-03-16 19:08:08,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:08:09,081 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-var-start-time.4.ufo.UNBOUNDED.pals.c[9488,9501] [2025-03-16 19:08:09,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:08:09,093 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:08:09,129 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-var-start-time.4.ufo.UNBOUNDED.pals.c[9488,9501] [2025-03-16 19:08:09,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:08:09,141 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:08:09,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09 WrapperNode [2025-03-16 19:08:09,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:08:09,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:08:09,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:08:09,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:08:09,147 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:08:09" (1/1) ... [2025-03-16 19:08:09,152 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:08:09" (1/1) ... [2025-03-16 19:08:09,176 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 312 [2025-03-16 19:08:09,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:08:09,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:08:09,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:08:09,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:08:09,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,209 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:08:09,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:08:09,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:08:09,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:08:09,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:08:09,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (1/1) ... [2025-03-16 19:08:09,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:08:09,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:09,251 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:08:09,253 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:08:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:08:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:08:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:08:09,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:08:09,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:08:09,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:08:09,688 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-16 19:08:09,688 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:08:09,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:08:09,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:08:09,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:08:09 BoogieIcfgContainer [2025-03-16 19:08:09,699 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:08:09,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:08:09,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:08:09,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:08:09,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:08:08" (1/3) ... [2025-03-16 19:08:09,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8c0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:08:09, skipping insertion in model container [2025-03-16 19:08:09,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:08:09" (2/3) ... [2025-03-16 19:08:09,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c8c0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:08:09, skipping insertion in model container [2025-03-16 19:08:09,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:08:09" (3/3) ... [2025-03-16 19:08:09,707 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2025-03-16 19:08:09,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:08:09,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c that has 1 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:08:09,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:08:09,760 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;@a0c94d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:08:09,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:08:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 79 states have (on average 1.759493670886076) internal successors, (139), 80 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have 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:08:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 19:08:09,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:09,769 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] [2025-03-16 19:08:09,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:09,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash 702594846, now seen corresponding path program 1 times [2025-03-16 19:08:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:09,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411338080] [2025-03-16 19:08:09,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:09,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 19:08:09,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 19:08:09,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:09,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:09,948 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:08:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:09,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411338080] [2025-03-16 19:08:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411338080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:09,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:09,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:08:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172013154] [2025-03-16 19:08:09,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:08:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:09,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:08:09,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:08:09,971 INFO L87 Difference]: Start difference. First operand has 81 states, 79 states have (on average 1.759493670886076) internal successors, (139), 80 states have internal predecessors, (139), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:08:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:09,986 INFO L93 Difference]: Finished difference Result 133 states and 225 transitions. [2025-03-16 19:08:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:08:09,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-16 19:08:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:09,993 INFO L225 Difference]: With dead ends: 133 [2025-03-16 19:08:09,993 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 19:08:09,996 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:08:09,998 INFO L435 NwaCegarLoop]: 135 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, 135 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:08:09,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 19:08:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-16 19:08:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 78 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have 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:08:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 135 transitions. [2025-03-16 19:08:10,045 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 135 transitions. Word has length 26 [2025-03-16 19:08:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:10,045 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 135 transitions. [2025-03-16 19:08:10,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:08:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 135 transitions. [2025-03-16 19:08:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 19:08:10,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:10,046 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] [2025-03-16 19:08:10,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:08:10,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1947359327, now seen corresponding path program 1 times [2025-03-16 19:08:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418536417] [2025-03-16 19:08:10,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:10,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 19:08:10,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 19:08:10,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:10,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,320 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:08:10,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418536417] [2025-03-16 19:08:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418536417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:10,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:10,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:08:10,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465932445] [2025-03-16 19:08:10,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:10,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:08:10,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:10,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:08:10,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:08:10,322 INFO L87 Difference]: Start difference. First operand 79 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:08:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:10,378 INFO L93 Difference]: Finished difference Result 133 states and 221 transitions. [2025-03-16 19:08:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:08:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-16 19:08:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:10,379 INFO L225 Difference]: With dead ends: 133 [2025-03-16 19:08:10,379 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 19:08:10,379 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:08:10,380 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:10,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 19:08:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-16 19:08:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:08:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 111 transitions. [2025-03-16 19:08:10,386 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 111 transitions. Word has length 26 [2025-03-16 19:08:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 111 transitions. [2025-03-16 19:08:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:08:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 111 transitions. [2025-03-16 19:08:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:08:10,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:10,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:10,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:08:10,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:10,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1988294671, now seen corresponding path program 1 times [2025-03-16 19:08:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070974647] [2025-03-16 19:08:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:10,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:08:10,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:08:10,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:10,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,478 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:08:10,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070974647] [2025-03-16 19:08:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070974647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556038588] [2025-03-16 19:08:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:10,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:10,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:10,480 INFO L87 Difference]: Start difference. First operand 79 states and 111 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:10,504 INFO L93 Difference]: Finished difference Result 173 states and 263 transitions. [2025-03-16 19:08:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:08:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:10,507 INFO L225 Difference]: With dead ends: 173 [2025-03-16 19:08:10,507 INFO L226 Difference]: Without dead ends: 122 [2025-03-16 19:08:10,508 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:08:10,508 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 67 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:10,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-16 19:08:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-16 19:08:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.495798319327731) internal successors, (178), 119 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have 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:08:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2025-03-16 19:08:10,517 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 49 [2025-03-16 19:08:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:10,518 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2025-03-16 19:08:10,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2025-03-16 19:08:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:08:10,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:10,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:10,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:08:10,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1607841214, now seen corresponding path program 1 times [2025-03-16 19:08:10,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:10,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126809806] [2025-03-16 19:08:10,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:10,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:08:10,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:08:10,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:10,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,591 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:08:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:10,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126809806] [2025-03-16 19:08:10,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126809806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:10,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:10,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:10,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982890523] [2025-03-16 19:08:10,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:10,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:10,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:10,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:10,593 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:10,608 INFO L93 Difference]: Finished difference Result 288 states and 450 transitions. [2025-03-16 19:08:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:08:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:10,610 INFO L225 Difference]: With dead ends: 288 [2025-03-16 19:08:10,610 INFO L226 Difference]: Without dead ends: 196 [2025-03-16 19:08:10,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:10,611 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 63 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:10,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 237 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-16 19:08:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2025-03-16 19:08:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.538860103626943) internal successors, (297), 193 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have 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:08:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 297 transitions. [2025-03-16 19:08:10,621 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 297 transitions. Word has length 49 [2025-03-16 19:08:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:10,621 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 297 transitions. [2025-03-16 19:08:10,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 297 transitions. [2025-03-16 19:08:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:08:10,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:10,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:08:10,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:10,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash 400600565, now seen corresponding path program 1 times [2025-03-16 19:08:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559066371] [2025-03-16 19:08:10,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:10,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:08:10,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:08:10,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:10,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,690 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:08:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:10,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559066371] [2025-03-16 19:08:10,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559066371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:10,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:10,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887824649] [2025-03-16 19:08:10,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:10,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:10,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:10,692 INFO L87 Difference]: Start difference. First operand 194 states and 297 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:10,714 INFO L93 Difference]: Finished difference Result 494 states and 779 transitions. [2025-03-16 19:08:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:08:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:10,716 INFO L225 Difference]: With dead ends: 494 [2025-03-16 19:08:10,716 INFO L226 Difference]: Without dead ends: 328 [2025-03-16 19:08:10,717 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:08:10,717 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 59 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:10,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-16 19:08:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2025-03-16 19:08:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.5538461538461539) internal successors, (505), 325 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have 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:08:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 505 transitions. [2025-03-16 19:08:10,739 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 505 transitions. Word has length 49 [2025-03-16 19:08:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:10,740 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 505 transitions. [2025-03-16 19:08:10,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 505 transitions. [2025-03-16 19:08:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:08:10,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:10,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:10,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:08:10,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:10,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 921363240, now seen corresponding path program 1 times [2025-03-16 19:08:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:10,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742783804] [2025-03-16 19:08:10,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:08:10,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:08:10,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:10,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:10,869 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:08:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:10,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742783804] [2025-03-16 19:08:10,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742783804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:10,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:10,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893628293] [2025-03-16 19:08:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:10,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:10,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:10,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:10,871 INFO L87 Difference]: Start difference. First operand 326 states and 505 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:10,990 INFO L93 Difference]: Finished difference Result 1816 states and 2890 transitions. [2025-03-16 19:08:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:10,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:08:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:10,998 INFO L225 Difference]: With dead ends: 1816 [2025-03-16 19:08:10,998 INFO L226 Difference]: Without dead ends: 1518 [2025-03-16 19:08:11,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:08:11,002 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 606 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:11,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 815 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-03-16 19:08:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 622. [2025-03-16 19:08:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.5539452495974235) internal successors, (965), 621 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have 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:08:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 965 transitions. [2025-03-16 19:08:11,043 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 965 transitions. Word has length 49 [2025-03-16 19:08:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,043 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 965 transitions. [2025-03-16 19:08:11,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:08:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 965 transitions. [2025-03-16 19:08:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:08:11,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:11,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:08:11,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1501555364, now seen corresponding path program 1 times [2025-03-16 19:08:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132066378] [2025-03-16 19:08:11,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:08:11,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:08:11,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,317 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:08:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132066378] [2025-03-16 19:08:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132066378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348015689] [2025-03-16 19:08:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:11,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:11,320 INFO L87 Difference]: Start difference. First operand 622 states and 965 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,356 INFO L93 Difference]: Finished difference Result 656 states and 1014 transitions. [2025-03-16 19:08:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:11,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 19:08:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,359 INFO L225 Difference]: With dead ends: 656 [2025-03-16 19:08:11,359 INFO L226 Difference]: Without dead ends: 654 [2025-03-16 19:08:11,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:11,362 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:11,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-16 19:08:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-03-16 19:08:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.5267993874425727) internal successors, (997), 653 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have 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:08:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 997 transitions. [2025-03-16 19:08:11,389 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 997 transitions. Word has length 50 [2025-03-16 19:08:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,390 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 997 transitions. [2025-03-16 19:08:11,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 997 transitions. [2025-03-16 19:08:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:08:11,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:11,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:08:11,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 699285864, now seen corresponding path program 1 times [2025-03-16 19:08:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70293980] [2025-03-16 19:08:11,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:08:11,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:08:11,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,471 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:08:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70293980] [2025-03-16 19:08:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70293980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:11,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039073300] [2025-03-16 19:08:11,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:11,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:11,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:11,472 INFO L87 Difference]: Start difference. First operand 654 states and 997 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,507 INFO L93 Difference]: Finished difference Result 1794 states and 2743 transitions. [2025-03-16 19:08:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:11,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 19:08:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,512 INFO L225 Difference]: With dead ends: 1794 [2025-03-16 19:08:11,512 INFO L226 Difference]: Without dead ends: 1168 [2025-03-16 19:08:11,513 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:08:11,514 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 51 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 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:08:11,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-03-16 19:08:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1150. [2025-03-16 19:08:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.5013054830287207) internal successors, (1725), 1149 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have 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:08:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1725 transitions. [2025-03-16 19:08:11,553 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1725 transitions. Word has length 51 [2025-03-16 19:08:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,553 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1725 transitions. [2025-03-16 19:08:11,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1725 transitions. [2025-03-16 19:08:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:08:11,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:11,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:08:11,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1567095470, now seen corresponding path program 1 times [2025-03-16 19:08:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952588267] [2025-03-16 19:08:11,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:08:11,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:08:11,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,610 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:08:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952588267] [2025-03-16 19:08:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952588267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623181291] [2025-03-16 19:08:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:11,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:11,611 INFO L87 Difference]: Start difference. First operand 1150 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,650 INFO L93 Difference]: Finished difference Result 2245 states and 3395 transitions. [2025-03-16 19:08:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:08:11,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 19:08:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,657 INFO L225 Difference]: With dead ends: 2245 [2025-03-16 19:08:11,657 INFO L226 Difference]: Without dead ends: 1618 [2025-03-16 19:08:11,658 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:08:11,659 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:11,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 250 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-16 19:08:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1616. [2025-03-16 19:08:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 1.4904024767801858) internal successors, (2407), 1615 states have internal predecessors, (2407), 0 states have call successors, (0), 0 states have 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:08:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2407 transitions. [2025-03-16 19:08:11,708 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2407 transitions. Word has length 53 [2025-03-16 19:08:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:11,708 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2407 transitions. [2025-03-16 19:08:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2407 transitions. [2025-03-16 19:08:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:11,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:11,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:08:11,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:11,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1658215970, now seen corresponding path program 1 times [2025-03-16 19:08:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:11,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341983452] [2025-03-16 19:08:11,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:11,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:11,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:11,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:11,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:08:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341983452] [2025-03-16 19:08:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341983452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029017111] [2025-03-16 19:08:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:11,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:11,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:11,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:11,849 INFO L87 Difference]: Start difference. First operand 1616 states and 2407 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:08:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:11,961 INFO L93 Difference]: Finished difference Result 4554 states and 6888 transitions. [2025-03-16 19:08:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 74 [2025-03-16 19:08:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:11,974 INFO L225 Difference]: With dead ends: 4554 [2025-03-16 19:08:11,974 INFO L226 Difference]: Without dead ends: 3752 [2025-03-16 19:08:11,977 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:08:11,978 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 477 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:11,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 672 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2025-03-16 19:08:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2400. [2025-03-16 19:08:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.491871613172155) internal successors, (3579), 2399 states have internal predecessors, (3579), 0 states have call successors, (0), 0 states have 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:08:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3579 transitions. [2025-03-16 19:08:12,042 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3579 transitions. Word has length 74 [2025-03-16 19:08:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:12,043 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3579 transitions. [2025-03-16 19:08:12,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:08:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3579 transitions. [2025-03-16 19:08:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:12,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:12,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:12,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:08:12,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1855650891, now seen corresponding path program 1 times [2025-03-16 19:08:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688402099] [2025-03-16 19:08:12,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:12,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:12,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:12,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:08:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688402099] [2025-03-16 19:08:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688402099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335450457] [2025-03-16 19:08:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:12,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:12,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:12,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:12,160 INFO L87 Difference]: Start difference. First operand 2400 states and 3579 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:12,285 INFO L93 Difference]: Finished difference Result 5338 states and 8060 transitions. [2025-03-16 19:08:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:12,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:08:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:12,300 INFO L225 Difference]: With dead ends: 5338 [2025-03-16 19:08:12,300 INFO L226 Difference]: Without dead ends: 4536 [2025-03-16 19:08:12,305 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:08:12,306 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 513 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:12,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 603 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2025-03-16 19:08:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3184. [2025-03-16 19:08:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 1.4926170279610431) internal successors, (4751), 3183 states have internal predecessors, (4751), 0 states have call successors, (0), 0 states have 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:08:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4751 transitions. [2025-03-16 19:08:12,392 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4751 transitions. Word has length 74 [2025-03-16 19:08:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:12,392 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 4751 transitions. [2025-03-16 19:08:12,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4751 transitions. [2025-03-16 19:08:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:08:12,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:12,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:12,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:08:12,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:12,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1249077960, now seen corresponding path program 1 times [2025-03-16 19:08:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492795779] [2025-03-16 19:08:12,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:12,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:08:12,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:08:12,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:12,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:08:12,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:12,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492795779] [2025-03-16 19:08:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492795779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:12,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145603255] [2025-03-16 19:08:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:12,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:12,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:12,520 INFO L87 Difference]: Start difference. First operand 3184 states and 4751 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:08:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:12,662 INFO L93 Difference]: Finished difference Result 6122 states and 9232 transitions. [2025-03-16 19:08:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:12,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 74 [2025-03-16 19:08:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:12,679 INFO L225 Difference]: With dead ends: 6122 [2025-03-16 19:08:12,679 INFO L226 Difference]: Without dead ends: 5320 [2025-03-16 19:08:12,682 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:08:12,683 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 488 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:12,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 643 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:08:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2025-03-16 19:08:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 3968. [2025-03-16 19:08:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3968 states, 3967 states have (on average 1.4930678094277792) internal successors, (5923), 3967 states have internal predecessors, (5923), 0 states have call successors, (0), 0 states have 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:08:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 5923 transitions. [2025-03-16 19:08:12,786 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 5923 transitions. Word has length 74 [2025-03-16 19:08:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:12,786 INFO L471 AbstractCegarLoop]: Abstraction has 3968 states and 5923 transitions. [2025-03-16 19:08:12,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:08:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 5923 transitions. [2025-03-16 19:08:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:08:12,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:12,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:12,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:08:12,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:12,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1966271097, now seen corresponding path program 1 times [2025-03-16 19:08:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391879891] [2025-03-16 19:08:12,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:12,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:08:12,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:08:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:12,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:13,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391879891] [2025-03-16 19:08:13,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391879891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:13,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332775781] [2025-03-16 19:08:13,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:13,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:13,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:13,140 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:08:13,141 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:08:13,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:08:13,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:08:13,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:13,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:13,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 19:08:13,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:14,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:14,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332775781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:14,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:14,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-16 19:08:14,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615540688] [2025-03-16 19:08:14,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:14,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 19:08:14,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:14,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 19:08:14,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:08:14,594 INFO L87 Difference]: Start difference. First operand 3968 states and 5923 transitions. Second operand has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 24 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have 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:08:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:21,881 INFO L93 Difference]: Finished difference Result 47229 states and 68908 transitions. [2025-03-16 19:08:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-03-16 19:08:21,882 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 24 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 19:08:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:21,962 INFO L225 Difference]: With dead ends: 47229 [2025-03-16 19:08:21,962 INFO L226 Difference]: Without dead ends: 43291 [2025-03-16 19:08:21,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8145 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3823, Invalid=17347, Unknown=0, NotChecked=0, Total=21170 [2025-03-16 19:08:21,976 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 6972 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6972 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:21,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6972 Valid, 1178 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:08:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43291 states. [2025-03-16 19:08:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43291 to 32183. [2025-03-16 19:08:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32183 states, 32182 states have (on average 1.4426387421539992) internal successors, (46427), 32182 states have internal predecessors, (46427), 0 states have call successors, (0), 0 states have 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:08:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32183 states to 32183 states and 46427 transitions. [2025-03-16 19:08:23,138 INFO L78 Accepts]: Start accepts. Automaton has 32183 states and 46427 transitions. Word has length 75 [2025-03-16 19:08:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:23,138 INFO L471 AbstractCegarLoop]: Abstraction has 32183 states and 46427 transitions. [2025-03-16 19:08:23,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 24 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have 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:08:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32183 states and 46427 transitions. [2025-03-16 19:08:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:08:23,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:23,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:23,148 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:08:23,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 19:08:23,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:23,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash -104141083, now seen corresponding path program 1 times [2025-03-16 19:08:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:23,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012260993] [2025-03-16 19:08:23,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:23,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:08:23,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:08:23,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:23,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:23,456 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:08:23,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012260993] [2025-03-16 19:08:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012260993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:23,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:08:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417492765] [2025-03-16 19:08:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:23,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:08:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:23,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:08:23,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:08:23,459 INFO L87 Difference]: Start difference. First operand 32183 states and 46427 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:24,273 INFO L93 Difference]: Finished difference Result 58490 states and 85224 transitions. [2025-03-16 19:08:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:08:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:08:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:24,353 INFO L225 Difference]: With dead ends: 58490 [2025-03-16 19:08:24,353 INFO L226 Difference]: Without dead ends: 51844 [2025-03-16 19:08:24,363 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:08:24,364 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 464 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:24,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 775 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:08:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51844 states. [2025-03-16 19:08:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51844 to 38593. [2025-03-16 19:08:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38593 states, 38592 states have (on average 1.441153606965174) internal successors, (55617), 38592 states have internal predecessors, (55617), 0 states have call successors, (0), 0 states have 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:08:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38593 states to 38593 states and 55617 transitions. [2025-03-16 19:08:25,335 INFO L78 Accepts]: Start accepts. Automaton has 38593 states and 55617 transitions. Word has length 76 [2025-03-16 19:08:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:25,336 INFO L471 AbstractCegarLoop]: Abstraction has 38593 states and 55617 transitions. [2025-03-16 19:08:25,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:08:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38593 states and 55617 transitions. [2025-03-16 19:08:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:08:25,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:25,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:25,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:08:25,338 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:25,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1649467994, now seen corresponding path program 1 times [2025-03-16 19:08:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:25,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324781297] [2025-03-16 19:08:25,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:25,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:08:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:08:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:25,642 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:08:25,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324781297] [2025-03-16 19:08:25,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324781297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:08:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234308086] [2025-03-16 19:08:25,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:25,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:08:25,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:08:25,644 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:08:25,646 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:08:25,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:08:25,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:08:25,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:25,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:25,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:08:25,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:08:26,123 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:08:26,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:08:26,986 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:08:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234308086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:08:26,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:08:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 19:08:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819673362] [2025-03-16 19:08:26,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:08:26,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:08:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:26,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:08:26,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:08:26,989 INFO L87 Difference]: Start difference. First operand 38593 states and 55617 transitions. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 22 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:08:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:08:41,445 INFO L93 Difference]: Finished difference Result 692349 states and 1010076 transitions. [2025-03-16 19:08:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2025-03-16 19:08:41,446 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 22 states have internal predecessors, (225), 0 states have call successors, (0), 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 79 [2025-03-16 19:08:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:08:42,513 INFO L225 Difference]: With dead ends: 692349 [2025-03-16 19:08:42,513 INFO L226 Difference]: Without dead ends: 654182 [2025-03-16 19:08:42,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18659 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5516, Invalid=40066, Unknown=0, NotChecked=0, Total=45582 [2025-03-16 19:08:42,674 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 6138 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6138 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:08:42,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6138 Valid, 2394 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:08:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654182 states. [2025-03-16 19:08:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654182 to 286727. [2025-03-16 19:08:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286727 states, 286726 states have (on average 1.4332080104350495) internal successors, (410938), 286726 states have internal predecessors, (410938), 0 states have call successors, (0), 0 states have 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:08:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286727 states to 286727 states and 410938 transitions. [2025-03-16 19:08:53,466 INFO L78 Accepts]: Start accepts. Automaton has 286727 states and 410938 transitions. Word has length 79 [2025-03-16 19:08:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:08:53,467 INFO L471 AbstractCegarLoop]: Abstraction has 286727 states and 410938 transitions. [2025-03-16 19:08:53,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 22 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:08:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 286727 states and 410938 transitions. [2025-03-16 19:08:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:08:53,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:08:53,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:08:53,478 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:08:53,672 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,SelfDestructingSolverStorable14 [2025-03-16 19:08:53,672 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:08:53,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:08:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash -116294848, now seen corresponding path program 1 times [2025-03-16 19:08:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:08:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538070930] [2025-03-16 19:08:53,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:08:53,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:08:53,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:08:53,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:08:53,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:08:53,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:08:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:08:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:08:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538070930] [2025-03-16 19:08:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538070930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:08:53,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:08:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:08:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966086866] [2025-03-16 19:08:53,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:08:53,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:08:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:08:53,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:08:53,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:08:53,752 INFO L87 Difference]: Start difference. First operand 286727 states and 410938 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)