./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.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.4.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:09:35,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:09:35,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:09:35,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:09:35,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:09:35,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:09:35,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:09:35,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:09:35,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:09:35,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:09:35,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:09:35,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:09:35,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:09:35,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:09:35,514 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:09:35,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:09:35,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:09:35,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:09:35,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:09:35,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:09:35,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:09:35,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:09:35,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:09:35,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:09:35,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:09:35,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:09:35,517 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 -> 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d [2025-03-16 19:09:35,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:09:35,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:09:35,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:09:35,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:09:35,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:09:35,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:36,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dda393f9/6af45542e0c6423c87520cb79d3848a1/FLAG54e1584fe [2025-03-16 19:09:37,110 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:09:37,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:37,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dda393f9/6af45542e0c6423c87520cb79d3848a1/FLAG54e1584fe [2025-03-16 19:09:37,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dda393f9/6af45542e0c6423c87520cb79d3848a1 [2025-03-16 19:09:37,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:09:37,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:09:37,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:37,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:09:37,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:09:37,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445125b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37, skipping insertion in model container [2025-03-16 19:09:37,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:09:37,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2025-03-16 19:09:37,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:37,350 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:09:37,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2025-03-16 19:09:37,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:37,412 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:09:37,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37 WrapperNode [2025-03-16 19:09:37,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:37,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:37,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:09:37,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:09:37,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,448 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 276 [2025-03-16 19:09:37,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:37,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:09:37,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:09:37,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:09:37,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,481 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:09:37,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,485 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:09:37,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:09:37,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:09:37,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:09:37,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (1/1) ... [2025-03-16 19:09:37,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:09:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:37,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:09:37,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:09:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:09:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:09:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:09:37,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:09:37,596 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:09:37,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:09:37,846 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-16 19:09:37,846 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:09:37,852 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:09:37,852 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:09:37,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:37 BoogieIcfgContainer [2025-03-16 19:09:37,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:09:37,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:09:37,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:09:37,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:09:37,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:09:37" (1/3) ... [2025-03-16 19:09:37,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798ed64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:37, skipping insertion in model container [2025-03-16 19:09:37,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:37" (2/3) ... [2025-03-16 19:09:37,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798ed64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:37, skipping insertion in model container [2025-03-16 19:09:37,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:37" (3/3) ... [2025-03-16 19:09:37,859 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:37,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:09:37,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:09:37,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:09:37,924 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;@620d0a23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:09:37,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:09:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.765625) internal successors, (113), 65 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 19:09:37,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:37,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:37,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:37,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1150725868, now seen corresponding path program 1 times [2025-03-16 19:09:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513783839] [2025-03-16 19:09:37,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:38,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 19:09:38,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 19:09:38,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:38,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513783839] [2025-03-16 19:09:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513783839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:38,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:09:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161351305] [2025-03-16 19:09:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:38,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:09:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:38,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:09:38,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:38,299 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.765625) internal successors, (113), 65 states have internal predecessors, (113), 0 states have call successors, (0), 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 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:38,352 INFO L93 Difference]: Finished difference Result 106 states and 178 transitions. [2025-03-16 19:09:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:09:38,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-16 19:09:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:38,359 INFO L225 Difference]: With dead ends: 106 [2025-03-16 19:09:38,360 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 19:09:38,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:38,365 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:38,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 19:09:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-16 19:09:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2025-03-16 19:09:38,389 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 18 [2025-03-16 19:09:38,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:38,389 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2025-03-16 19:09:38,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2025-03-16 19:09:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:09:38,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:38,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:38,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:09:38,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:38,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1143271242, now seen corresponding path program 1 times [2025-03-16 19:09:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:38,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480420772] [2025-03-16 19:09:38,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:38,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:38,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:09:38,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:09:38,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:38,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480420772] [2025-03-16 19:09:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480420772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:38,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:38,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:38,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743493690] [2025-03-16 19:09:38,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:38,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:38,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:38,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:38,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:38,573 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:38,734 INFO L93 Difference]: Finished difference Result 360 states and 558 transitions. [2025-03-16 19:09:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:09:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-16 19:09:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:38,736 INFO L225 Difference]: With dead ends: 360 [2025-03-16 19:09:38,736 INFO L226 Difference]: Without dead ends: 323 [2025-03-16 19:09:38,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:09:38,737 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 517 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:38,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 682 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-16 19:09:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 99. [2025-03-16 19:09:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 98 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2025-03-16 19:09:38,749 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 40 [2025-03-16 19:09:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:38,749 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2025-03-16 19:09:38,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2025-03-16 19:09:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:09:38,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:38,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:38,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:09:38,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:38,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:38,751 INFO L85 PathProgramCache]: Analyzing trace with hash 864103707, now seen corresponding path program 1 times [2025-03-16 19:09:38,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:38,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112073830] [2025-03-16 19:09:38,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:38,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:38,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:09:38,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:09:38,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:38,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112073830] [2025-03-16 19:09:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112073830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:38,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:38,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304208640] [2025-03-16 19:09:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:38,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:38,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:38,821 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:38,856 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2025-03-16 19:09:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-16 19:09:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:38,857 INFO L225 Difference]: With dead ends: 232 [2025-03-16 19:09:38,857 INFO L226 Difference]: Without dead ends: 160 [2025-03-16 19:09:38,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:38,858 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:38,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:38,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-16 19:09:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-03-16 19:09:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4838709677419355) internal successors, (230), 155 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 230 transitions. [2025-03-16 19:09:38,871 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 230 transitions. Word has length 42 [2025-03-16 19:09:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:38,872 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 230 transitions. [2025-03-16 19:09:38,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 230 transitions. [2025-03-16 19:09:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:09:38,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:38,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:38,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:09:38,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:38,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash 865146392, now seen corresponding path program 1 times [2025-03-16 19:09:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:38,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929975340] [2025-03-16 19:09:38,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:38,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:09:38,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:09:38,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:38,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929975340] [2025-03-16 19:09:39,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929975340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385623327] [2025-03-16 19:09:39,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:39,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:39,101 INFO L87 Difference]: Start difference. First operand 156 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,193 INFO L93 Difference]: Finished difference Result 287 states and 434 transitions. [2025-03-16 19:09:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-16 19:09:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,195 INFO L225 Difference]: With dead ends: 287 [2025-03-16 19:09:39,195 INFO L226 Difference]: Without dead ends: 158 [2025-03-16 19:09:39,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:39,196 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 135 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 246 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-16 19:09:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-03-16 19:09:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 155 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2025-03-16 19:09:39,208 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 42 [2025-03-16 19:09:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,208 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2025-03-16 19:09:39,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2025-03-16 19:09:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 19:09:39,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:09:39,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1050719435, now seen corresponding path program 1 times [2025-03-16 19:09:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314557995] [2025-03-16 19:09:39,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 19:09:39,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:09:39,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314557995] [2025-03-16 19:09:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314557995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838859625] [2025-03-16 19:09:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:39,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:39,414 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,440 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2025-03-16 19:09:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:39,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 19:09:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,441 INFO L225 Difference]: With dead ends: 162 [2025-03-16 19:09:39,441 INFO L226 Difference]: Without dead ends: 160 [2025-03-16 19:09:39,441 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:09:39,442 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-16 19:09:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-16 19:09:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.4528301886792452) internal successors, (231), 159 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2025-03-16 19:09:39,446 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 43 [2025-03-16 19:09:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,447 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2025-03-16 19:09:39,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2025-03-16 19:09:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:39,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:09:39,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash -151451046, now seen corresponding path program 1 times [2025-03-16 19:09:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621810803] [2025-03-16 19:09:39,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:39,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:39,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621810803] [2025-03-16 19:09:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621810803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524288252] [2025-03-16 19:09:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,488 INFO L87 Difference]: Start difference. First operand 160 states and 231 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,498 INFO L93 Difference]: Finished difference Result 410 states and 611 transitions. [2025-03-16 19:09:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:09:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,500 INFO L225 Difference]: With dead ends: 410 [2025-03-16 19:09:39,500 INFO L226 Difference]: Without dead ends: 277 [2025-03-16 19:09:39,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,501 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-16 19:09:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2025-03-16 19:09:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.467153284671533) internal successors, (402), 274 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 402 transitions. [2025-03-16 19:09:39,527 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 402 transitions. Word has length 44 [2025-03-16 19:09:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,527 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 402 transitions. [2025-03-16 19:09:39,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 402 transitions. [2025-03-16 19:09:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:39,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:09:39,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,529 INFO L85 PathProgramCache]: Analyzing trace with hash -217633446, now seen corresponding path program 1 times [2025-03-16 19:09:39,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610807276] [2025-03-16 19:09:39,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:39,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:39,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610807276] [2025-03-16 19:09:39,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610807276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864842051] [2025-03-16 19:09:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,567 INFO L87 Difference]: Start difference. First operand 275 states and 402 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,582 INFO L93 Difference]: Finished difference Result 739 states and 1096 transitions. [2025-03-16 19:09:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:09:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,583 INFO L225 Difference]: With dead ends: 739 [2025-03-16 19:09:39,584 INFO L226 Difference]: Without dead ends: 491 [2025-03-16 19:09:39,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,584 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 45 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-16 19:09:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2025-03-16 19:09:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.459016393442623) internal successors, (712), 488 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 712 transitions. [2025-03-16 19:09:39,596 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 712 transitions. Word has length 44 [2025-03-16 19:09:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,596 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 712 transitions. [2025-03-16 19:09:39,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 712 transitions. [2025-03-16 19:09:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:39,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:09:39,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash -767422374, now seen corresponding path program 1 times [2025-03-16 19:09:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873913508] [2025-03-16 19:09:39,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:39,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:39,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873913508] [2025-03-16 19:09:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873913508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556940931] [2025-03-16 19:09:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,638 INFO L87 Difference]: Start difference. First operand 489 states and 712 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,661 INFO L93 Difference]: Finished difference Result 1349 states and 1970 transitions. [2025-03-16 19:09:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 19:09:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,665 INFO L225 Difference]: With dead ends: 1349 [2025-03-16 19:09:39,665 INFO L226 Difference]: Without dead ends: 887 [2025-03-16 19:09:39,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,667 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 43 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 190 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-16 19:09:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2025-03-16 19:09:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.4343891402714932) internal successors, (1268), 884 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1268 transitions. [2025-03-16 19:09:39,708 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1268 transitions. Word has length 44 [2025-03-16 19:09:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,708 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1268 transitions. [2025-03-16 19:09:39,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1268 transitions. [2025-03-16 19:09:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 19:09:39,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,708 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] [2025-03-16 19:09:39,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:09:39,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 617187674, now seen corresponding path program 1 times [2025-03-16 19:09:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327646056] [2025-03-16 19:09:39,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:09:39,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:09:39,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327646056] [2025-03-16 19:09:39,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327646056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:39,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450347020] [2025-03-16 19:09:39,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:39,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:39,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,747 INFO L87 Difference]: Start difference. First operand 885 states and 1268 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:39,780 INFO L93 Difference]: Finished difference Result 1788 states and 2602 transitions. [2025-03-16 19:09:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:39,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-16 19:09:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:39,784 INFO L225 Difference]: With dead ends: 1788 [2025-03-16 19:09:39,784 INFO L226 Difference]: Without dead ends: 1289 [2025-03-16 19:09:39,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:39,785 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 46 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:39,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-03-16 19:09:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1287. [2025-03-16 19:09:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.4292379471228616) internal successors, (1838), 1286 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1838 transitions. [2025-03-16 19:09:39,821 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1838 transitions. Word has length 46 [2025-03-16 19:09:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:39,821 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1838 transitions. [2025-03-16 19:09:39,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1838 transitions. [2025-03-16 19:09:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:39,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:39,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:39,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:09:39,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:39,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:39,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2016413816, now seen corresponding path program 1 times [2025-03-16 19:09:39,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:39,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258130075] [2025-03-16 19:09:39,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:39,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:39,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:39,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:39,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:39,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:09:39,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:39,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258130075] [2025-03-16 19:09:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258130075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:39,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:39,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:39,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811048121] [2025-03-16 19:09:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:39,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:39,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:39,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:39,923 INFO L87 Difference]: Start difference. First operand 1287 states and 1838 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:40,069 INFO L93 Difference]: Finished difference Result 6593 states and 9451 transitions. [2025-03-16 19:09:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:09:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:40,085 INFO L225 Difference]: With dead ends: 6593 [2025-03-16 19:09:40,085 INFO L226 Difference]: Without dead ends: 5335 [2025-03-16 19:09:40,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:40,088 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 343 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:40,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 462 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2025-03-16 19:09:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 2543. [2025-03-16 19:09:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2542 states have (on average 1.4248623131392604) internal successors, (3622), 2542 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3622 transitions. [2025-03-16 19:09:40,188 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3622 transitions. Word has length 60 [2025-03-16 19:09:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:40,189 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3622 transitions. [2025-03-16 19:09:40,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3622 transitions. [2025-03-16 19:09:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:40,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:40,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:09:40,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2082596216, now seen corresponding path program 1 times [2025-03-16 19:09:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000947556] [2025-03-16 19:09:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:40,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:40,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:40,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:40,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:09:40,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:40,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000947556] [2025-03-16 19:09:40,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000947556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:40,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:40,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296871326] [2025-03-16 19:09:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:40,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:40,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:40,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:40,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:40,306 INFO L87 Difference]: Start difference. First operand 2543 states and 3622 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:40,464 INFO L93 Difference]: Finished difference Result 7849 states and 11235 transitions. [2025-03-16 19:09:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:09:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:40,482 INFO L225 Difference]: With dead ends: 7849 [2025-03-16 19:09:40,482 INFO L226 Difference]: Without dead ends: 6591 [2025-03-16 19:09:40,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:40,486 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 363 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:40,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 431 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2025-03-16 19:09:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 4431. [2025-03-16 19:09:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4430 states have (on average 1.4171557562076749) internal successors, (6278), 4430 states have internal predecessors, (6278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 6278 transitions. [2025-03-16 19:09:40,612 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 6278 transitions. Word has length 60 [2025-03-16 19:09:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:40,612 INFO L471 AbstractCegarLoop]: Abstraction has 4431 states and 6278 transitions. [2025-03-16 19:09:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 6278 transitions. [2025-03-16 19:09:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:40,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:40,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:40,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:09:40,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:40,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1662582152, now seen corresponding path program 1 times [2025-03-16 19:09:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:40,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264449214] [2025-03-16 19:09:40,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:40,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:09:40,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:40,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264449214] [2025-03-16 19:09:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264449214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991750197] [2025-03-16 19:09:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:40,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:40,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:40,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:40,716 INFO L87 Difference]: Start difference. First operand 4431 states and 6278 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:40,878 INFO L93 Difference]: Finished difference Result 9105 states and 13019 transitions. [2025-03-16 19:09:40,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:40,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:09:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:40,898 INFO L225 Difference]: With dead ends: 9105 [2025-03-16 19:09:40,898 INFO L226 Difference]: Without dead ends: 7847 [2025-03-16 19:09:40,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:40,902 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 353 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:40,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 436 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7847 states. [2025-03-16 19:09:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7847 to 5687. [2025-03-16 19:09:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5687 states, 5686 states have (on average 1.4178684488216673) internal successors, (8062), 5686 states have internal predecessors, (8062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 8062 transitions. [2025-03-16 19:09:41,072 INFO L78 Accepts]: Start accepts. Automaton has 5687 states and 8062 transitions. Word has length 60 [2025-03-16 19:09:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:41,072 INFO L471 AbstractCegarLoop]: Abstraction has 5687 states and 8062 transitions. [2025-03-16 19:09:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5687 states and 8062 transitions. [2025-03-16 19:09:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:09:41,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:41,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:41,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:09:41,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash -706244502, now seen corresponding path program 1 times [2025-03-16 19:09:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84493364] [2025-03-16 19:09:41,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:41,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:09:41,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:09:41,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:41,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:41,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:41,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84493364] [2025-03-16 19:09:41,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84493364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:41,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:41,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:41,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909342270] [2025-03-16 19:09:41,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:41,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:41,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:41,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:41,164 INFO L87 Difference]: Start difference. First operand 5687 states and 8062 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:41,229 INFO L93 Difference]: Finished difference Result 9740 states and 13914 transitions. [2025-03-16 19:09:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:09:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:41,243 INFO L225 Difference]: With dead ends: 9740 [2025-03-16 19:09:41,245 INFO L226 Difference]: Without dead ends: 4082 [2025-03-16 19:09:41,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:41,252 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:41,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2025-03-16 19:09:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 4080. [2025-03-16 19:09:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4080 states, 4079 states have (on average 1.42363324344202) internal successors, (5807), 4079 states have internal predecessors, (5807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 5807 transitions. [2025-03-16 19:09:41,377 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 5807 transitions. Word has length 62 [2025-03-16 19:09:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:41,377 INFO L471 AbstractCegarLoop]: Abstraction has 4080 states and 5807 transitions. [2025-03-16 19:09:41,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 5807 transitions. [2025-03-16 19:09:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:09:41,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:41,378 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] [2025-03-16 19:09:41,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:09:41,379 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:41,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:41,379 INFO L85 PathProgramCache]: Analyzing trace with hash -610671864, now seen corresponding path program 1 times [2025-03-16 19:09:41,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:41,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312756299] [2025-03-16 19:09:41,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:41,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:09:41,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:09:41,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:41,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312756299] [2025-03-16 19:09:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312756299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:41,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:41,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:41,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120792843] [2025-03-16 19:09:41,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:41,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:41,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:41,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:41,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:41,469 INFO L87 Difference]: Start difference. First operand 4080 states and 5807 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:41,644 INFO L93 Difference]: Finished difference Result 7674 states and 10996 transitions. [2025-03-16 19:09:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:09:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:41,657 INFO L225 Difference]: With dead ends: 7674 [2025-03-16 19:09:41,657 INFO L226 Difference]: Without dead ends: 6776 [2025-03-16 19:09:41,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:41,659 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 341 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:41,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 514 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6776 states. [2025-03-16 19:09:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6776 to 4976. [2025-03-16 19:09:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4976 states, 4975 states have (on average 1.4245226130653266) internal successors, (7087), 4975 states have internal predecessors, (7087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4976 states to 4976 states and 7087 transitions. [2025-03-16 19:09:41,772 INFO L78 Accepts]: Start accepts. Automaton has 4976 states and 7087 transitions. Word has length 62 [2025-03-16 19:09:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 4976 states and 7087 transitions. [2025-03-16 19:09:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4976 states and 7087 transitions. [2025-03-16 19:09:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:09:41,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:41,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:41,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:09:41,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:41,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash -186972589, now seen corresponding path program 1 times [2025-03-16 19:09:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:41,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144630429] [2025-03-16 19:09:41,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:41,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:09:41,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:09:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144630429] [2025-03-16 19:09:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144630429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559392883] [2025-03-16 19:09:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:41,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:41,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:41,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:41,843 INFO L87 Difference]: Start difference. First operand 4976 states and 7087 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:41,901 INFO L93 Difference]: Finished difference Result 7444 states and 10609 transitions. [2025-03-16 19:09:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:41,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:09:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:41,905 INFO L225 Difference]: With dead ends: 7444 [2025-03-16 19:09:41,905 INFO L226 Difference]: Without dead ends: 2514 [2025-03-16 19:09:41,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:41,910 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:41,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 175 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2025-03-16 19:09:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2512. [2025-03-16 19:09:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2511 states have (on average 1.4030266825965751) internal successors, (3523), 2511 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 3523 transitions. [2025-03-16 19:09:41,971 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 3523 transitions. Word has length 63 [2025-03-16 19:09:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:41,971 INFO L471 AbstractCegarLoop]: Abstraction has 2512 states and 3523 transitions. [2025-03-16 19:09:41,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 3523 transitions. [2025-03-16 19:09:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:09:41,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:41,976 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] [2025-03-16 19:09:41,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:09:41,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:41,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 836684588, now seen corresponding path program 1 times [2025-03-16 19:09:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221443555] [2025-03-16 19:09:41,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:41,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:09:41,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:09:41,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:42,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:42,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221443555] [2025-03-16 19:09:42,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221443555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:42,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:42,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:42,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761517887] [2025-03-16 19:09:42,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:42,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:42,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:42,046 INFO L87 Difference]: Start difference. First operand 2512 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:42,070 INFO L93 Difference]: Finished difference Result 3748 states and 5263 transitions. [2025-03-16 19:09:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:09:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:42,072 INFO L225 Difference]: With dead ends: 3748 [2025-03-16 19:09:42,072 INFO L226 Difference]: Without dead ends: 1282 [2025-03-16 19:09:42,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:42,075 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:42,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 160 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2025-03-16 19:09:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1280. [2025-03-16 19:09:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3784206411258797) internal successors, (1763), 1279 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1763 transitions. [2025-03-16 19:09:42,099 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1763 transitions. Word has length 65 [2025-03-16 19:09:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:42,099 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1763 transitions. [2025-03-16 19:09:42,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1763 transitions. [2025-03-16 19:09:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:09:42,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:42,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:42,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:09:42,100 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:42,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -536081659, now seen corresponding path program 1 times [2025-03-16 19:09:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728734570] [2025-03-16 19:09:42,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:42,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:09:42,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:09:42,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:42,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:42,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728734570] [2025-03-16 19:09:42,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728734570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:42,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:42,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:42,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602469556] [2025-03-16 19:09:42,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:42,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:42,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:42,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:42,179 INFO L87 Difference]: Start difference. First operand 1280 states and 1763 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:09:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:42,198 INFO L93 Difference]: Finished difference Result 1900 states and 2623 transitions. [2025-03-16 19:09:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 67 [2025-03-16 19:09:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:42,200 INFO L225 Difference]: With dead ends: 1900 [2025-03-16 19:09:42,200 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 19:09:42,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:42,201 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 31 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:42,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 19:09:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2025-03-16 19:09:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.3484162895927603) internal successors, (894), 663 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 894 transitions. [2025-03-16 19:09:42,220 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 894 transitions. Word has length 67 [2025-03-16 19:09:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:42,220 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 894 transitions. [2025-03-16 19:09:42,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:09:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 894 transitions. [2025-03-16 19:09:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:09:42,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:42,221 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] [2025-03-16 19:09:42,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:09:42,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:42,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 853693918, now seen corresponding path program 1 times [2025-03-16 19:09:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253893091] [2025-03-16 19:09:42,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:42,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:09:42,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:09:42,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:42,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:43,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253893091] [2025-03-16 19:09:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253893091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084332574] [2025-03-16 19:09:43,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:43,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:43,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:43,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:43,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:09:43,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:09:43,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:09:43,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:43,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:43,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:09:43,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:43,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084332574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:44,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2025-03-16 19:09:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193759299] [2025-03-16 19:09:44,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:44,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:09:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:44,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:09:44,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:09:44,105 INFO L87 Difference]: Start difference. First operand 664 states and 894 transitions. Second operand has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:47,514 INFO L93 Difference]: Finished difference Result 4751 states and 6377 transitions. [2025-03-16 19:09:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-16 19:09:47,514 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:09:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:47,520 INFO L225 Difference]: With dead ends: 4751 [2025-03-16 19:09:47,520 INFO L226 Difference]: Without dead ends: 4133 [2025-03-16 19:09:47,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=881, Invalid=3675, Unknown=0, NotChecked=0, Total=4556 [2025-03-16 19:09:47,523 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1188 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:47,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 753 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:09:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2025-03-16 19:09:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 4013. [2025-03-16 19:09:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4013 states, 4012 states have (on average 1.2794117647058822) internal successors, (5133), 4012 states have internal predecessors, (5133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 5133 transitions. [2025-03-16 19:09:47,616 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 5133 transitions. Word has length 69 [2025-03-16 19:09:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:47,616 INFO L471 AbstractCegarLoop]: Abstraction has 4013 states and 5133 transitions. [2025-03-16 19:09:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 5133 transitions. [2025-03-16 19:09:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:09:47,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:47,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:47,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:09:47,823 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,SelfDestructingSolverStorable17 [2025-03-16 19:09:47,823 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:47,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1530181946, now seen corresponding path program 1 times [2025-03-16 19:09:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239157096] [2025-03-16 19:09:47,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:47,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:47,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:47,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:47,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:48,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:48,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239157096] [2025-03-16 19:09:48,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239157096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:48,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428738398] [2025-03-16 19:09:48,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:48,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:48,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:48,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:48,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:09:48,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:48,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:48,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:48,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:48,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:09:48,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:48,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428738398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:49,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2025-03-16 19:09:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058546689] [2025-03-16 19:09:49,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:49,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:09:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:49,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:09:49,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:09:49,198 INFO L87 Difference]: Start difference. First operand 4013 states and 5133 transitions. Second operand has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:49,671 INFO L93 Difference]: Finished difference Result 11899 states and 15311 transitions. [2025-03-16 19:09:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:09:49,672 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:09:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:49,683 INFO L225 Difference]: With dead ends: 11899 [2025-03-16 19:09:49,684 INFO L226 Difference]: Without dead ends: 8170 [2025-03-16 19:09:49,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 19:09:49,689 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 402 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:49,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 585 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:09:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2025-03-16 19:09:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 8038. [2025-03-16 19:09:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8038 states, 8037 states have (on average 1.2620380739081747) internal successors, (10143), 8037 states have internal predecessors, (10143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8038 states to 8038 states and 10143 transitions. [2025-03-16 19:09:49,920 INFO L78 Accepts]: Start accepts. Automaton has 8038 states and 10143 transitions. Word has length 70 [2025-03-16 19:09:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:49,920 INFO L471 AbstractCegarLoop]: Abstraction has 8038 states and 10143 transitions. [2025-03-16 19:09:49,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.642857142857143) internal successors, (186), 27 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8038 states and 10143 transitions. [2025-03-16 19:09:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:09:49,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:49,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:49,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:09:50,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:50,126 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:50,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1303883514, now seen corresponding path program 1 times [2025-03-16 19:09:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257796657] [2025-03-16 19:09:50,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:50,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:50,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:50,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:50,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257796657] [2025-03-16 19:09:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257796657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:51,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64674397] [2025-03-16 19:09:51,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:51,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:51,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:51,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:51,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:09:51,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:51,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:51,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:51,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:51,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:09:51,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:51,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64674397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:51,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2025-03-16 19:09:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107043021] [2025-03-16 19:09:51,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 19:09:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:51,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 19:09:51,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:09:51,999 INFO L87 Difference]: Start difference. First operand 8038 states and 10143 transitions. Second operand has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:53,738 INFO L93 Difference]: Finished difference Result 21908 states and 27909 transitions. [2025-03-16 19:09:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-16 19:09:53,739 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:09:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:53,759 INFO L225 Difference]: With dead ends: 21908 [2025-03-16 19:09:53,760 INFO L226 Difference]: Without dead ends: 17113 [2025-03-16 19:09:53,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=820, Invalid=3736, Unknown=0, NotChecked=0, Total=4556 [2025-03-16 19:09:53,768 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1582 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:53,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 905 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:09:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17113 states. [2025-03-16 19:09:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17113 to 16767. [2025-03-16 19:09:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16767 states, 16766 states have (on average 1.2502684003340092) internal successors, (20962), 16766 states have internal predecessors, (20962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16767 states to 16767 states and 20962 transitions. [2025-03-16 19:09:54,138 INFO L78 Accepts]: Start accepts. Automaton has 16767 states and 20962 transitions. Word has length 70 [2025-03-16 19:09:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:54,138 INFO L471 AbstractCegarLoop]: Abstraction has 16767 states and 20962 transitions. [2025-03-16 19:09:54,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 32 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 16767 states and 20962 transitions. [2025-03-16 19:09:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:09:54,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:54,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:54,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:09:54,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:54,340 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:54,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash -635743046, now seen corresponding path program 1 times [2025-03-16 19:09:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:54,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382558003] [2025-03-16 19:09:54,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:54,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:54,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:54,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:54,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:54,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382558003] [2025-03-16 19:09:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382558003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358339836] [2025-03-16 19:09:55,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:55,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:55,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:55,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:09:55,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:55,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:55,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:55,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:55,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:09:55,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:55,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:56,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358339836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:56,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:56,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-03-16 19:09:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412041238] [2025-03-16 19:09:56,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:56,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:09:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:56,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:09:56,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:09:56,424 INFO L87 Difference]: Start difference. First operand 16767 states and 20962 transitions. Second operand has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:57,716 INFO L93 Difference]: Finished difference Result 39096 states and 49068 transitions. [2025-03-16 19:09:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 19:09:57,717 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:09:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:57,748 INFO L225 Difference]: With dead ends: 39096 [2025-03-16 19:09:57,748 INFO L226 Difference]: Without dead ends: 24029 [2025-03-16 19:09:57,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=481, Invalid=1969, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 19:09:57,761 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 930 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:57,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1013 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:09:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2025-03-16 19:09:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 22315. [2025-03-16 19:09:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22315 states, 22314 states have (on average 1.2485883301962892) internal successors, (27861), 22314 states have internal predecessors, (27861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22315 states to 22315 states and 27861 transitions. [2025-03-16 19:09:58,309 INFO L78 Accepts]: Start accepts. Automaton has 22315 states and 27861 transitions. Word has length 70 [2025-03-16 19:09:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:58,309 INFO L471 AbstractCegarLoop]: Abstraction has 22315 states and 27861 transitions. [2025-03-16 19:09:58,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.0) internal successors, (182), 25 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:09:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 22315 states and 27861 transitions. [2025-03-16 19:09:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:09:58,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:58,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:58,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 19:09:58,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:58,511 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:58,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1665071145, now seen corresponding path program 1 times [2025-03-16 19:09:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37869508] [2025-03-16 19:09:58,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:58,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:09:58,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:09:58,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:58,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37869508] [2025-03-16 19:09:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37869508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439678033] [2025-03-16 19:09:58,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:58,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:58,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:09:58,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:09:58,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:09:58,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:09:58,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:58,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:58,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:09:58,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:59,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:00,071 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:10:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439678033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:00,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2025-03-16 19:10:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182826282] [2025-03-16 19:10:00,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:00,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:10:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:00,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:10:00,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:10:00,073 INFO L87 Difference]: Start difference. First operand 22315 states and 27861 transitions. Second operand has 28 states, 28 states have (on average 7.035714285714286) internal successors, (197), 27 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:10:00,871 INFO L93 Difference]: Finished difference Result 41981 states and 52596 transitions. [2025-03-16 19:10:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:10:00,872 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.035714285714286) internal successors, (197), 27 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:10:00,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:10:00,895 INFO L225 Difference]: With dead ends: 41981 [2025-03-16 19:10:00,895 INFO L226 Difference]: Without dead ends: 23231 [2025-03-16 19:10:00,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 19:10:00,907 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 485 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:10:00,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 618 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:10:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23231 states. [2025-03-16 19:10:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23231 to 20503. [2025-03-16 19:10:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20503 states, 20502 states have (on average 1.2369037167105648) internal successors, (25359), 20502 states have internal predecessors, (25359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20503 states to 20503 states and 25359 transitions. [2025-03-16 19:10:01,377 INFO L78 Accepts]: Start accepts. Automaton has 20503 states and 25359 transitions. Word has length 71 [2025-03-16 19:10:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:10:01,378 INFO L471 AbstractCegarLoop]: Abstraction has 20503 states and 25359 transitions. [2025-03-16 19:10:01,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.035714285714286) internal successors, (197), 27 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20503 states and 25359 transitions. [2025-03-16 19:10:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:10:01,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:10:01,380 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] [2025-03-16 19:10:01,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 19:10:01,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-16 19:10:01,584 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:10:01,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:10:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1922095252, now seen corresponding path program 1 times [2025-03-16 19:10:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:10:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382545852] [2025-03-16 19:10:01,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:01,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:10:01,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:10:01,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:10:01,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:01,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:02,535 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:10:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:10:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382545852] [2025-03-16 19:10:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382545852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:10:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363915898] [2025-03-16 19:10:02,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:02,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:02,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:10:02,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:10:02,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:10:02,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:10:02,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:10:02,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:02,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:02,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:10:02,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:10:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:03,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:04,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363915898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:04,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:04,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 45 [2025-03-16 19:10:04,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212547771] [2025-03-16 19:10:04,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:04,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 19:10:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:04,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 19:10:04,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2025-03-16 19:10:04,724 INFO L87 Difference]: Start difference. First operand 20503 states and 25359 transitions. Second operand has 45 states, 45 states have (on average 4.4) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:10:13,394 INFO L93 Difference]: Finished difference Result 42958 states and 54059 transitions. [2025-03-16 19:10:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-16 19:10:13,395 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.4) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 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 72 [2025-03-16 19:10:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:10:13,427 INFO L225 Difference]: With dead ends: 42958 [2025-03-16 19:10:13,427 INFO L226 Difference]: Without dead ends: 33716 [2025-03-16 19:10:13,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4833 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2638, Invalid=16268, Unknown=0, NotChecked=0, Total=18906 [2025-03-16 19:10:13,439 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3448 mSDsluCounter, 3339 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3448 SdHoareTripleChecker+Valid, 3458 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:10:13,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3448 Valid, 3458 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:10:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33716 states. [2025-03-16 19:10:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33716 to 22390. [2025-03-16 19:10:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22390 states, 22389 states have (on average 1.241681182723659) internal successors, (27800), 22389 states have internal predecessors, (27800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22390 states to 22390 states and 27800 transitions. [2025-03-16 19:10:14,220 INFO L78 Accepts]: Start accepts. Automaton has 22390 states and 27800 transitions. Word has length 72 [2025-03-16 19:10:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:10:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 22390 states and 27800 transitions. [2025-03-16 19:10:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.4) internal successors, (198), 45 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 22390 states and 27800 transitions. [2025-03-16 19:10:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:10:14,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:10:14,221 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] [2025-03-16 19:10:14,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 19:10:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:14,421 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:10:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:10:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 47542420, now seen corresponding path program 1 times [2025-03-16 19:10:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:10:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280764975] [2025-03-16 19:10:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:10:14,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:10:14,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:10:14,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:14,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:10:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280764975] [2025-03-16 19:10:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280764975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:10:14,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875399538] [2025-03-16 19:10:14,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:14,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:14,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:10:14,908 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:10:14,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 19:10:14,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:10:14,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:10:14,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:14,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:15,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-16 19:10:15,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:10:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:16,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:19,017 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:10:19,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875399538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:19,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:19,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 23, 19] total 51 [2025-03-16 19:10:19,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710988223] [2025-03-16 19:10:19,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-16 19:10:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:19,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-16 19:10:19,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2207, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 19:10:19,019 INFO L87 Difference]: Start difference. First operand 22390 states and 27800 transitions. Second operand has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:10:37,655 INFO L93 Difference]: Finished difference Result 45666 states and 56885 transitions. [2025-03-16 19:10:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-16 19:10:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 0 states have call successors, (0), 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 72 [2025-03-16 19:10:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:10:37,687 INFO L225 Difference]: With dead ends: 45666 [2025-03-16 19:10:37,687 INFO L226 Difference]: Without dead ends: 33898 [2025-03-16 19:10:37,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7254 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=3469, Invalid=17993, Unknown=0, NotChecked=0, Total=21462 [2025-03-16 19:10:37,702 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 2140 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 3018 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:10:37,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 2729 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3018 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 19:10:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33898 states. [2025-03-16 19:10:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33898 to 20948. [2025-03-16 19:10:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20948 states, 20947 states have (on average 1.2418007351888098) internal successors, (26012), 20947 states have internal predecessors, (26012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20948 states to 20948 states and 26012 transitions. [2025-03-16 19:10:38,441 INFO L78 Accepts]: Start accepts. Automaton has 20948 states and 26012 transitions. Word has length 72 [2025-03-16 19:10:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:10:38,441 INFO L471 AbstractCegarLoop]: Abstraction has 20948 states and 26012 transitions. [2025-03-16 19:10:38,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:10:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 20948 states and 26012 transitions. [2025-03-16 19:10:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:10:38,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:10:38,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:10:38,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 19:10:38,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:38,646 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:10:38,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:10:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash -914382187, now seen corresponding path program 1 times [2025-03-16 19:10:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:10:38,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839025864] [2025-03-16 19:10:38,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:10:38,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:10:38,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:10:38,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:38,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:10:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839025864] [2025-03-16 19:10:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839025864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:10:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503913141] [2025-03-16 19:10:39,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:39,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:10:39,047 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:10:39,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 19:10:39,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:10:39,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:10:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:39,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-16 19:10:39,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:10:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:45,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:48,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503913141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:48,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:48,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 26] total 60 [2025-03-16 19:10:48,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472295338] [2025-03-16 19:10:48,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:48,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-16 19:10:48,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:48,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-16 19:10:48,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=3194, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 19:10:48,541 INFO L87 Difference]: Start difference. First operand 20948 states and 26012 transitions. Second operand has 61 states, 61 states have (on average 3.2950819672131146) internal successors, (201), 60 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)