./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.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 a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:48:53,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:48:53,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:48:53,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:48:53,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:48:53,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:48:53,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:48:53,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:48:53,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:48:53,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:48:53,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:48:53,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:48:53,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:48:53,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:48:53,351 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:48:53,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:48:53,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:48:53,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:48:53,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:48:53,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:48:53,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:48:53,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:48:53,354 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 -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2025-03-03 14:48:53,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:48:53,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:48:53,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:48:53,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:48:53,572 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:48:53,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2025-03-03 14:48:54,726 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e38ddb4a/145ea3f4d3d449f1b005d47a653cf339/FLAG38decfbd4 [2025-03-03 14:48:54,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:48:54,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2025-03-03 14:48:54,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e38ddb4a/145ea3f4d3d449f1b005d47a653cf339/FLAG38decfbd4 [2025-03-03 14:48:55,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e38ddb4a/145ea3f4d3d449f1b005d47a653cf339 [2025-03-03 14:48:55,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:48:55,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:48:55,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:48:55,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:48:55,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:48:55,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b657fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55, skipping insertion in model container [2025-03-03 14:48:55,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:48:55,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2025-03-03 14:48:55,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:48:55,229 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:48:55,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2025-03-03 14:48:55,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:48:55,267 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:48:55,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55 WrapperNode [2025-03-03 14:48:55,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:48:55,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:48:55,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:48:55,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:48:55,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,295 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-03-03 14:48:55,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:48:55,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:48:55,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:48:55,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:48:55,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,315 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:48:55,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:48:55,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:48:55,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:48:55,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:48:55,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (1/1) ... [2025-03-03 14:48:55,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:48:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:48:55,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:48:55,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:48:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:48:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:48:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:48:55,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:48:55,416 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:48:55,417 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:48:55,739 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 14:48:55,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:48:55,751 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:48:55,751 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:48:55,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:48:55 BoogieIcfgContainer [2025-03-03 14:48:55,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:48:55,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:48:55,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:48:55,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:48:55,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:48:55" (1/3) ... [2025-03-03 14:48:55,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ad3d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:48:55, skipping insertion in model container [2025-03-03 14:48:55,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:48:55" (2/3) ... [2025-03-03 14:48:55,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ad3d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:48:55, skipping insertion in model container [2025-03-03 14:48:55,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:48:55" (3/3) ... [2025-03-03 14:48:55,759 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2025-03-03 14:48:55,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:48:55,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c that has 1 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:48:55,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:48:55,821 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;@2d3e1ed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:48:55,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:48:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 64 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:48:55,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:55,830 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] [2025-03-03 14:48:55,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:55,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1228800365, now seen corresponding path program 1 times [2025-03-03 14:48:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:55,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913256433] [2025-03-03 14:48:55,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:55,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:48:55,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:48:55,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:55,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:56,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913256433] [2025-03-03 14:48:56,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913256433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:56,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:56,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:48:56,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893345406] [2025-03-03 14:48:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:56,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:48:56,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:56,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:48:56,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:48:56,030 INFO L87 Difference]: Start difference. First operand has 65 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 64 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:56,041 INFO L93 Difference]: Finished difference Result 108 states and 174 transitions. [2025-03-03 14:48:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:48:56,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-03 14:48:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:56,047 INFO L225 Difference]: With dead ends: 108 [2025-03-03 14:48:56,047 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 14:48:56,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:48:56,051 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:56,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 14:48:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-03 14:48:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 102 transitions. [2025-03-03 14:48:56,072 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 102 transitions. Word has length 25 [2025-03-03 14:48:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:56,072 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 102 transitions. [2025-03-03 14:48:56,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 102 transitions. [2025-03-03 14:48:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:48:56,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:56,073 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] [2025-03-03 14:48:56,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:48:56,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:56,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1637624590, now seen corresponding path program 1 times [2025-03-03 14:48:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-03 14:48:56,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:56,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:48:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:48:56,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:56,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281603050] [2025-03-03 14:48:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281603050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:56,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:48:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314506553] [2025-03-03 14:48:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:48:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:56,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:48:56,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:48:56,237 INFO L87 Difference]: Start difference. First operand 62 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:56,298 INFO L93 Difference]: Finished difference Result 144 states and 230 transitions. [2025-03-03 14:48:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:48:56,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-03 14:48:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:56,302 INFO L225 Difference]: With dead ends: 144 [2025-03-03 14:48:56,302 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 14:48:56,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:48:56,304 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 61 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:56,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 369 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 14:48:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2025-03-03 14:48:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-03-03 14:48:56,310 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 25 [2025-03-03 14:48:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-03-03 14:48:56,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-03-03 14:48:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 14:48:56,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:56,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:48:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:48:56,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash -151113246, now seen corresponding path program 1 times [2025-03-03 14:48:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972811850] [2025-03-03 14:48:56,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:56,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 14:48:56,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 14:48:56,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:56,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:56,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972811850] [2025-03-03 14:48:56,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972811850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:56,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:56,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193188272] [2025-03-03 14:48:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:56,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:56,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:56,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:56,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:56,430 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:56,462 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2025-03-03 14:48:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 14:48:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:56,464 INFO L225 Difference]: With dead ends: 133 [2025-03-03 14:48:56,464 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 14:48:56,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:56,464 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:56,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 14:48:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-03-03 14:48:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 91 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2025-03-03 14:48:56,470 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 41 [2025-03-03 14:48:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:56,470 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2025-03-03 14:48:56,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2025-03-03 14:48:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 14:48:56,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:56,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:48:56,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:48:56,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:56,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1626171917, now seen corresponding path program 1 times [2025-03-03 14:48:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926574733] [2025-03-03 14:48:56,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:56,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:56,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 14:48:56,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 14:48:56,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:56,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926574733] [2025-03-03 14:48:56,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926574733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:56,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:56,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:48:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029992708] [2025-03-03 14:48:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:48:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:48:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:48:56,614 INFO L87 Difference]: Start difference. First operand 92 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:56,685 INFO L93 Difference]: Finished difference Result 368 states and 573 transitions. [2025-03-03 14:48:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:48:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 14:48:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:56,690 INFO L225 Difference]: With dead ends: 368 [2025-03-03 14:48:56,690 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 14:48:56,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:48:56,691 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 350 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:56,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 283 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 14:48:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 159. [2025-03-03 14:48:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.5063291139240507) internal successors, (238), 158 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 238 transitions. [2025-03-03 14:48:56,705 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 238 transitions. Word has length 41 [2025-03-03 14:48:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:56,705 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 238 transitions. [2025-03-03 14:48:56,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 238 transitions. [2025-03-03 14:48:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 14:48:56,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:56,706 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-03 14:48:56,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:48:56,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:56,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:56,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1098663913, now seen corresponding path program 1 times [2025-03-03 14:48:56,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:56,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-03-03 14:48:56,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:56,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:56,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 14:48:56,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 14:48:56,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:56,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338344809] [2025-03-03 14:48:56,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338344809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:56,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:56,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:48:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922939275] [2025-03-03 14:48:56,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:56,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:48:56,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:56,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:48:56,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:48:56,954 INFO L87 Difference]: Start difference. First operand 159 states and 238 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-03 14:48:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:57,003 INFO L93 Difference]: Finished difference Result 173 states and 255 transitions. [2025-03-03 14:48:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:48:57,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-03 14:48:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:57,006 INFO L225 Difference]: With dead ends: 173 [2025-03-03 14:48:57,007 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 14:48:57,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:48:57,008 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:57,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 14:48:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-03 14:48:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 170 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2025-03-03 14:48:57,020 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 42 [2025-03-03 14:48:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:57,020 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2025-03-03 14:48:57,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-03 14:48:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2025-03-03 14:48:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:48:57,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:57,021 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-03 14:48:57,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:48:57,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash 389876621, now seen corresponding path program 1 times [2025-03-03 14:48:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330403358] [2025-03-03 14:48:57,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:57,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:48:57,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:48:57,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:57,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330403358] [2025-03-03 14:48:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330403358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642008966] [2025-03-03 14:48:57,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:57,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:57,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:57,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,091 INFO L87 Difference]: Start difference. First operand 171 states and 250 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:57,106 INFO L93 Difference]: Finished difference Result 388 states and 581 transitions. [2025-03-03 14:48:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-03 14:48:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:57,108 INFO L225 Difference]: With dead ends: 388 [2025-03-03 14:48:57,108 INFO L226 Difference]: Without dead ends: 240 [2025-03-03 14:48:57,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,109 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:57,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-03 14:48:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-03-03 14:48:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.481012658227848) internal successors, (351), 237 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 351 transitions. [2025-03-03 14:48:57,122 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 351 transitions. Word has length 43 [2025-03-03 14:48:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:57,122 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 351 transitions. [2025-03-03 14:48:57,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 351 transitions. [2025-03-03 14:48:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:48:57,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:57,124 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-03 14:48:57,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:48:57,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:57,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 236740964, now seen corresponding path program 1 times [2025-03-03 14:48:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722430905] [2025-03-03 14:48:57,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:57,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:48:57,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:48:57,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:57,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722430905] [2025-03-03 14:48:57,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722430905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:57,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:57,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860231466] [2025-03-03 14:48:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:57,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:57,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:57,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,182 INFO L87 Difference]: Start difference. First operand 238 states and 351 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-03 14:48:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:57,203 INFO L93 Difference]: Finished difference Result 616 states and 919 transitions. [2025-03-03 14:48:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:57,203 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-03 14:48:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:57,205 INFO L225 Difference]: With dead ends: 616 [2025-03-03 14:48:57,205 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 14:48:57,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,207 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:57,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 14:48:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2025-03-03 14:48:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.465) internal successors, (586), 400 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 586 transitions. [2025-03-03 14:48:57,227 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 586 transitions. Word has length 44 [2025-03-03 14:48:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:57,228 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 586 transitions. [2025-03-03 14:48:57,228 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-03 14:48:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 586 transitions. [2025-03-03 14:48:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:48:57,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:57,229 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-03 14:48:57,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:48:57,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:57,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -921934926, now seen corresponding path program 1 times [2025-03-03 14:48:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-03-03 14:48:57,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:57,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:57,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:48:57,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:48:57,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:57,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:57,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-03-03 14:48:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662790227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:57,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:57,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:57,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214458404] [2025-03-03 14:48:57,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:57,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:57,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:57,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:57,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,289 INFO L87 Difference]: Start difference. First operand 401 states and 586 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-03 14:48:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:57,312 INFO L93 Difference]: Finished difference Result 1057 states and 1540 transitions. [2025-03-03 14:48:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:57,313 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-03 14:48:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:57,316 INFO L225 Difference]: With dead ends: 1057 [2025-03-03 14:48:57,316 INFO L226 Difference]: Without dead ends: 681 [2025-03-03 14:48:57,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,317 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 46 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:57,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-03 14:48:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 679. [2025-03-03 14:48:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.424778761061947) internal successors, (966), 678 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 966 transitions. [2025-03-03 14:48:57,359 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 966 transitions. Word has length 44 [2025-03-03 14:48:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:57,360 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 966 transitions. [2025-03-03 14:48:57,360 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-03 14:48:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 966 transitions. [2025-03-03 14:48:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:48:57,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:57,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:48:57,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:48:57,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:57,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash 277560254, now seen corresponding path program 1 times [2025-03-03 14:48:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:57,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-03-03 14:48:57,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:57,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:48:57,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:48:57,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:57,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:57,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:57,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72362284] [2025-03-03 14:48:57,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72362284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:57,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824407986] [2025-03-03 14:48:57,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:57,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:57,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:57,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,487 INFO L87 Difference]: Start difference. First operand 679 states and 966 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-03 14:48:57,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:57,504 INFO L93 Difference]: Finished difference Result 1335 states and 1908 transitions. [2025-03-03 14:48:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:57,505 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-03 14:48:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:57,508 INFO L225 Difference]: With dead ends: 1335 [2025-03-03 14:48:57,508 INFO L226 Difference]: Without dead ends: 681 [2025-03-03 14:48:57,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,509 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:57,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-03 14:48:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 679. [2025-03-03 14:48:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.407079646017699) internal successors, (954), 678 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 954 transitions. [2025-03-03 14:48:57,534 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 954 transitions. Word has length 62 [2025-03-03 14:48:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:57,534 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 954 transitions. [2025-03-03 14:48:57,534 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-03 14:48:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 954 transitions. [2025-03-03 14:48:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:48:57,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:57,535 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] [2025-03-03 14:48:57,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:48:57,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:57,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash -22077359, now seen corresponding path program 1 times [2025-03-03 14:48:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:57,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-03-03 14:48:57,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:57,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:48:57,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:48:57,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:57,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:57,627 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-03 14:48:57,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:57,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-03-03 14:48:57,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407747318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:57,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:57,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:57,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497783895] [2025-03-03 14:48:57,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:57,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:57,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:57,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:57,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,629 INFO L87 Difference]: Start difference. First operand 679 states and 954 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-03 14:48:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:57,646 INFO L93 Difference]: Finished difference Result 1009 states and 1420 transitions. [2025-03-03 14:48:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:57,647 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-03 14:48:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:57,648 INFO L225 Difference]: With dead ends: 1009 [2025-03-03 14:48:57,648 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 14:48:57,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:57,650 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:57,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 14:48:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2025-03-03 14:48:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.375) internal successors, (484), 352 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 484 transitions. [2025-03-03 14:48:57,661 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 484 transitions. Word has length 62 [2025-03-03 14:48:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:57,661 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 484 transitions. [2025-03-03 14:48:57,661 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-03 14:48:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 484 transitions. [2025-03-03 14:48:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:48:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:57,662 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] [2025-03-03 14:48:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:48:57,662 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:57,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash -641055132, now seen corresponding path program 1 times [2025-03-03 14:48:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043928439] [2025-03-03 14:48:57,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:57,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:48:57,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:48:57,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:57,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:59,204 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-03 14:48:59,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:59,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043928439] [2025-03-03 14:48:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043928439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:48:59,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763735883] [2025-03-03 14:48:59,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:59,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:48:59,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:48:59,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:48:59,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:48:59,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:48:59,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:48:59,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:59,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:59,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:48:59,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:48:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:59,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:00,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763735883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:00,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:00,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 26 [2025-03-03 14:49:00,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862064910] [2025-03-03 14:49:00,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:00,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 14:49:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:00,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 14:49:00,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:49:00,434 INFO L87 Difference]: Start difference. First operand 353 states and 484 transitions. Second operand has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:08,635 INFO L93 Difference]: Finished difference Result 4184 states and 5625 transitions. [2025-03-03 14:49:08,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-03-03 14:49:08,635 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 14:49:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:08,646 INFO L225 Difference]: With dead ends: 4184 [2025-03-03 14:49:08,646 INFO L226 Difference]: Without dead ends: 3856 [2025-03-03 14:49:08,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6414 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2862, Invalid=15498, Unknown=0, NotChecked=0, Total=18360 [2025-03-03 14:49:08,653 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7313 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7313 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:08,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7313 Valid, 1238 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:49:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2025-03-03 14:49:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 1798. [2025-03-03 14:49:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 1.3594880356149137) internal successors, (2443), 1797 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2443 transitions. [2025-03-03 14:49:08,708 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2443 transitions. Word has length 62 [2025-03-03 14:49:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:08,708 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2443 transitions. [2025-03-03 14:49:08,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2443 transitions. [2025-03-03 14:49:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:49:08,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:08,709 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] [2025-03-03 14:49:08,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:49:08,909 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,SelfDestructingSolverStorable10 [2025-03-03 14:49:08,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:08,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 538501576, now seen corresponding path program 1 times [2025-03-03 14:49:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:08,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737804021] [2025-03-03 14:49:08,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:08,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:49:08,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:49:08,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:08,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:49:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737804021] [2025-03-03 14:49:08,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737804021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:08,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:08,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:08,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998396497] [2025-03-03 14:49:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:08,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:08,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:08,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:08,997 INFO L87 Difference]: Start difference. First operand 1798 states and 2443 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-03 14:49:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,063 INFO L93 Difference]: Finished difference Result 4464 states and 6125 transitions. [2025-03-03 14:49:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 14:49:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:09,073 INFO L225 Difference]: With dead ends: 4464 [2025-03-03 14:49:09,073 INFO L226 Difference]: Without dead ends: 3558 [2025-03-03 14:49:09,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:49:09,076 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 211 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:09,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 395 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:09,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2025-03-03 14:49:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 2648. [2025-03-03 14:49:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2647 states have (on average 1.354363430298451) internal successors, (3585), 2647 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3585 transitions. [2025-03-03 14:49:09,154 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 3585 transitions. Word has length 63 [2025-03-03 14:49:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:09,155 INFO L471 AbstractCegarLoop]: Abstraction has 2648 states and 3585 transitions. [2025-03-03 14:49:09,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-03 14:49:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 3585 transitions. [2025-03-03 14:49:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:49:09,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:09,155 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] [2025-03-03 14:49:09,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:49:09,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:09,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:09,156 INFO L85 PathProgramCache]: Analyzing trace with hash 927451252, now seen corresponding path program 1 times [2025-03-03 14:49:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:09,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-03 14:49:09,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:09,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:49:09,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:49:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:09,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:49:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-03 14:49:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233099860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:09,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:09,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433291539] [2025-03-03 14:49:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:09,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:09,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:09,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:09,222 INFO L87 Difference]: Start difference. First operand 2648 states and 3585 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-03 14:49:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,301 INFO L93 Difference]: Finished difference Result 5314 states and 7267 transitions. [2025-03-03 14:49:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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 63 [2025-03-03 14:49:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:09,314 INFO L225 Difference]: With dead ends: 5314 [2025-03-03 14:49:09,314 INFO L226 Difference]: Without dead ends: 4408 [2025-03-03 14:49:09,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:49:09,317 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 211 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:09,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 366 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2025-03-03 14:49:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 3498. [2025-03-03 14:49:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3497 states have (on average 1.3517300543322848) internal successors, (4727), 3497 states have internal predecessors, (4727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 4727 transitions. [2025-03-03 14:49:09,431 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 4727 transitions. Word has length 63 [2025-03-03 14:49:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:09,431 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 4727 transitions. [2025-03-03 14:49:09,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-03 14:49:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4727 transitions. [2025-03-03 14:49:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:49:09,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:09,434 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] [2025-03-03 14:49:09,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:49:09,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1983873471, now seen corresponding path program 1 times [2025-03-03 14:49:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484279832] [2025-03-03 14:49:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:09,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:49:09,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:49:09,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:09,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:49:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484279832] [2025-03-03 14:49:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484279832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:09,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:09,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:09,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621824] [2025-03-03 14:49:09,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:09,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:09,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:09,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:09,495 INFO L87 Difference]: Start difference. First operand 3498 states and 4727 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,581 INFO L93 Difference]: Finished difference Result 6164 states and 8409 transitions. [2025-03-03 14:49:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 14:49:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:09,594 INFO L225 Difference]: With dead ends: 6164 [2025-03-03 14:49:09,594 INFO L226 Difference]: Without dead ends: 5258 [2025-03-03 14:49:09,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:49:09,596 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 217 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:09,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 390 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2025-03-03 14:49:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4348. [2025-03-03 14:49:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4348 states, 4347 states have (on average 1.3501265240395675) internal successors, (5869), 4347 states have internal predecessors, (5869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4348 states to 4348 states and 5869 transitions. [2025-03-03 14:49:09,723 INFO L78 Accepts]: Start accepts. Automaton has 4348 states and 5869 transitions. Word has length 63 [2025-03-03 14:49:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:09,724 INFO L471 AbstractCegarLoop]: Abstraction has 4348 states and 5869 transitions. [2025-03-03 14:49:09,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4348 states and 5869 transitions. [2025-03-03 14:49:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:49:09,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:09,725 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] [2025-03-03 14:49:09,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:49:09,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:09,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1267716816, now seen corresponding path program 1 times [2025-03-03 14:49:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727485933] [2025-03-03 14:49:09,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:09,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:09,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:09,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:09,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727485933] [2025-03-03 14:49:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727485933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410891279] [2025-03-03 14:49:09,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:09,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:09,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:49:09,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:49:10,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:10,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:10,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:10,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:10,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:49:10,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:10,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:10,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410891279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:10,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-03 14:49:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068934893] [2025-03-03 14:49:10,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:10,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:49:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:10,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:49:10,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:49:10,777 INFO L87 Difference]: Start difference. First operand 4348 states and 5869 transitions. Second operand has 22 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 21 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:11,209 INFO L93 Difference]: Finished difference Result 15263 states and 20782 transitions. [2025-03-03 14:49:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:49:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 21 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:49:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:11,232 INFO L225 Difference]: With dead ends: 15263 [2025-03-03 14:49:11,232 INFO L226 Difference]: Without dead ends: 11011 [2025-03-03 14:49:11,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=821, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:49:11,238 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 789 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:11,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 400 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:49:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11011 states. [2025-03-03 14:49:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11011 to 10249. [2025-03-03 14:49:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10248 states have (on average 1.3291373926619827) internal successors, (13621), 10248 states have internal predecessors, (13621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 13621 transitions. [2025-03-03 14:49:11,497 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 13621 transitions. Word has length 66 [2025-03-03 14:49:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:11,497 INFO L471 AbstractCegarLoop]: Abstraction has 10249 states and 13621 transitions. [2025-03-03 14:49:11,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 21 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 13621 transitions. [2025-03-03 14:49:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:49:11,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:11,498 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] [2025-03-03 14:49:11,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:49:11,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:49:11,699 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:11,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 691335036, now seen corresponding path program 1 times [2025-03-03 14:49:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-03 14:49:11,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:11,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:11,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:11,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:11,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-03-03 14:49:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240889597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992202246] [2025-03-03 14:49:11,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:11,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:49:11,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:49:11,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:12,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 14:49:12,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:12,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992202246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:13,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:13,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 15] total 33 [2025-03-03 14:49:13,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855868564] [2025-03-03 14:49:13,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:13,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 14:49:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:13,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 14:49:13,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:49:13,060 INFO L87 Difference]: Start difference. First operand 10249 states and 13621 transitions. Second operand has 33 states, 33 states have (on average 5.0) internal successors, (165), 33 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:14,164 INFO L93 Difference]: Finished difference Result 28773 states and 38579 transitions. [2025-03-03 14:49:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:49:14,164 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.0) internal successors, (165), 33 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:49:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:14,197 INFO L225 Difference]: With dead ends: 28773 [2025-03-03 14:49:14,197 INFO L226 Difference]: Without dead ends: 18713 [2025-03-03 14:49:14,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=675, Invalid=2295, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 14:49:14,207 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1197 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:14,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 911 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:49:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2025-03-03 14:49:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 10596. [2025-03-03 14:49:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10596 states, 10595 states have (on average 1.328834355828221) internal successors, (14079), 10595 states have internal predecessors, (14079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10596 states to 10596 states and 14079 transitions. [2025-03-03 14:49:14,538 INFO L78 Accepts]: Start accepts. Automaton has 10596 states and 14079 transitions. Word has length 66 [2025-03-03 14:49:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:14,538 INFO L471 AbstractCegarLoop]: Abstraction has 10596 states and 14079 transitions. [2025-03-03 14:49:14,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.0) internal successors, (165), 33 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10596 states and 14079 transitions. [2025-03-03 14:49:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:49:14,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:14,539 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] [2025-03-03 14:49:14,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:49:14,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:14,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:14,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 69368144, now seen corresponding path program 1 times [2025-03-03 14:49:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839479153] [2025-03-03 14:49:14,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:14,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:14,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:14,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839479153] [2025-03-03 14:49:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839479153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635838974] [2025-03-03 14:49:14,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:14,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:14,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:14,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:49:14,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:49:14,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:15,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:15,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:15,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:15,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:49:15,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:15,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635838974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:16,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-03 14:49:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275082785] [2025-03-03 14:49:16,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:16,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 14:49:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:16,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 14:49:16,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:49:16,049 INFO L87 Difference]: Start difference. First operand 10596 states and 14079 transitions. Second operand has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:21,797 INFO L93 Difference]: Finished difference Result 61055 states and 81126 transitions. [2025-03-03 14:49:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-03-03 14:49:21,798 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:49:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:21,865 INFO L225 Difference]: With dead ends: 61055 [2025-03-03 14:49:21,865 INFO L226 Difference]: Without dead ends: 50637 [2025-03-03 14:49:21,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7125 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3410, Invalid=16612, Unknown=0, NotChecked=0, Total=20022 [2025-03-03 14:49:21,886 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2855 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:21,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 2047 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:49:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50637 states. [2025-03-03 14:49:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50637 to 21825. [2025-03-03 14:49:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21825 states, 21824 states have (on average 1.3179527126099706) internal successors, (28763), 21824 states have internal predecessors, (28763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21825 states to 21825 states and 28763 transitions. [2025-03-03 14:49:22,658 INFO L78 Accepts]: Start accepts. Automaton has 21825 states and 28763 transitions. Word has length 66 [2025-03-03 14:49:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:22,658 INFO L471 AbstractCegarLoop]: Abstraction has 21825 states and 28763 transitions. [2025-03-03 14:49:22,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 21825 states and 28763 transitions. [2025-03-03 14:49:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:49:22,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:22,659 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] [2025-03-03 14:49:22,666 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-03 14:49:22,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:49:22,860 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:22,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1244325251, now seen corresponding path program 1 times [2025-03-03 14:49:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-03-03 14:49:22,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:22,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:22,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:22,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:22,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:22,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:22,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-03-03 14:49:22,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135332934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:22,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:22,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861111008] [2025-03-03 14:49:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:22,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:22,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:22,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:22,944 INFO L87 Difference]: Start difference. First operand 21825 states and 28763 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:23,642 INFO L93 Difference]: Finished difference Result 59837 states and 78729 transitions. [2025-03-03 14:49:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:23,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:49:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:23,691 INFO L225 Difference]: With dead ends: 59837 [2025-03-03 14:49:23,691 INFO L226 Difference]: Without dead ends: 38188 [2025-03-03 14:49:23,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:23,708 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:23,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 201 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38188 states. [2025-03-03 14:49:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38188 to 38186. [2025-03-03 14:49:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38186 states, 38185 states have (on average 1.298886997512112) internal successors, (49598), 38185 states have internal predecessors, (49598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38186 states to 38186 states and 49598 transitions. [2025-03-03 14:49:25,170 INFO L78 Accepts]: Start accepts. Automaton has 38186 states and 49598 transitions. Word has length 66 [2025-03-03 14:49:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:25,171 INFO L471 AbstractCegarLoop]: Abstraction has 38186 states and 49598 transitions. [2025-03-03 14:49:25,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 38186 states and 49598 transitions. [2025-03-03 14:49:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:49:25,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:25,172 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] [2025-03-03 14:49:25,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:49:25,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:25,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash 420780885, now seen corresponding path program 1 times [2025-03-03 14:49:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256200927] [2025-03-03 14:49:25,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:25,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:49:25,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:49:25,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:25,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:25,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:25,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256200927] [2025-03-03 14:49:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256200927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563625523] [2025-03-03 14:49:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:25,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:25,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:25,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:25,203 INFO L87 Difference]: Start difference. First operand 38186 states and 49598 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-03 14:49:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:26,297 INFO L93 Difference]: Finished difference Result 87768 states and 113721 transitions. [2025-03-03 14:49:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:26,298 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-03 14:49:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:26,359 INFO L225 Difference]: With dead ends: 87768 [2025-03-03 14:49:26,359 INFO L226 Difference]: Without dead ends: 49974 [2025-03-03 14:49:26,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:26,381 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:26,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 166 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49974 states. [2025-03-03 14:49:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49974 to 49972. [2025-03-03 14:49:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49972 states, 49971 states have (on average 1.2700766444537832) internal successors, (63467), 49971 states have internal predecessors, (63467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49972 states to 49972 states and 63467 transitions. [2025-03-03 14:49:27,757 INFO L78 Accepts]: Start accepts. Automaton has 49972 states and 63467 transitions. Word has length 67 [2025-03-03 14:49:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:27,758 INFO L471 AbstractCegarLoop]: Abstraction has 49972 states and 63467 transitions. [2025-03-03 14:49:27,758 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-03 14:49:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 49972 states and 63467 transitions. [2025-03-03 14:49:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:49:27,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:27,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:49:27,760 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:27,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:27,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2132771498, now seen corresponding path program 1 times [2025-03-03 14:49:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092418584] [2025-03-03 14:49:27,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:27,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:49:27,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:49:27,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:27,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092418584] [2025-03-03 14:49:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092418584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914736891] [2025-03-03 14:49:28,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:28,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:28,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:28,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:49:28,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:49:28,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:49:28,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:49:28,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:28,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:28,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 14:49:28,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:28,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914736891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:30,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:30,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2025-03-03 14:49:30,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825312554] [2025-03-03 14:49:30,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:30,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 14:49:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:30,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 14:49:30,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:49:30,232 INFO L87 Difference]: Start difference. First operand 49972 states and 63467 transitions. Second operand has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:35,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:35,396 INFO L93 Difference]: Finished difference Result 159463 states and 203281 transitions. [2025-03-03 14:49:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 14:49:35,397 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:49:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:35,520 INFO L225 Difference]: With dead ends: 159463 [2025-03-03 14:49:35,520 INFO L226 Difference]: Without dead ends: 109762 [2025-03-03 14:49:35,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1406, Invalid=4144, Unknown=0, NotChecked=0, Total=5550 [2025-03-03 14:49:35,561 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 3582 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3582 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:35,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3582 Valid, 1049 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:49:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109762 states. [2025-03-03 14:49:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109762 to 57222. [2025-03-03 14:49:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57222 states, 57221 states have (on average 1.2627357089180546) internal successors, (72255), 57221 states have internal predecessors, (72255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57222 states to 57222 states and 72255 transitions. [2025-03-03 14:49:37,517 INFO L78 Accepts]: Start accepts. Automaton has 57222 states and 72255 transitions. Word has length 68 [2025-03-03 14:49:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:37,517 INFO L471 AbstractCegarLoop]: Abstraction has 57222 states and 72255 transitions. [2025-03-03 14:49:37,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 57222 states and 72255 transitions. [2025-03-03 14:49:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:49:37,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:37,530 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:37,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:49:37,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:37,730 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:37,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1248455150, now seen corresponding path program 1 times [2025-03-03 14:49:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:37,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522805052] [2025-03-03 14:49:37,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:37,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:49:37,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:49:37,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:37,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:49:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522805052] [2025-03-03 14:49:37,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522805052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:37,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256822199] [2025-03-03 14:49:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:37,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:37,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:37,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:37,774 INFO L87 Difference]: Start difference. First operand 57222 states and 72255 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:38,935 INFO L93 Difference]: Finished difference Result 71320 states and 89721 transitions. [2025-03-03 14:49:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:38,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-03 14:49:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:38,986 INFO L225 Difference]: With dead ends: 71320 [2025-03-03 14:49:38,987 INFO L226 Difference]: Without dead ends: 46530 [2025-03-03 14:49:39,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:39,011 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 29 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:39,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 180 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46530 states. [2025-03-03 14:49:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46530 to 46528. [2025-03-03 14:49:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46528 states, 46527 states have (on average 1.2415586648612633) internal successors, (57766), 46527 states have internal predecessors, (57766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46528 states to 46528 states and 57766 transitions. [2025-03-03 14:49:41,073 INFO L78 Accepts]: Start accepts. Automaton has 46528 states and 57766 transitions. Word has length 104 [2025-03-03 14:49:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:41,073 INFO L471 AbstractCegarLoop]: Abstraction has 46528 states and 57766 transitions. [2025-03-03 14:49:41,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 46528 states and 57766 transitions. [2025-03-03 14:49:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:49:41,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:41,086 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:49:41,086 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash -3860535, now seen corresponding path program 1 times [2025-03-03 14:49:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677351586] [2025-03-03 14:49:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:41,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:49:41,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:49:41,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:49:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677351586] [2025-03-03 14:49:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677351586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653585032] [2025-03-03 14:49:41,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:41,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:41,288 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:49:41,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:49:41,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:49:41,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:49:41,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:41,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:41,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:49:41,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 52 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:49:42,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 52 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:49:42,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653585032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:42,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:42,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 12] total 27 [2025-03-03 14:49:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792760267] [2025-03-03 14:49:42,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:49:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:42,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:49:42,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:49:42,670 INFO L87 Difference]: Start difference. First operand 46528 states and 57766 transitions. Second operand has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 27 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:49,533 INFO L93 Difference]: Finished difference Result 162843 states and 203832 transitions. [2025-03-03 14:49:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-03 14:49:49,535 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 27 states have internal predecessors, (262), 0 states have call successors, (0), 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 104 [2025-03-03 14:49:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:49,688 INFO L225 Difference]: With dead ends: 162843 [2025-03-03 14:49:49,688 INFO L226 Difference]: Without dead ends: 116571 [2025-03-03 14:49:49,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7706 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3908, Invalid=16972, Unknown=0, NotChecked=0, Total=20880 [2025-03-03 14:49:49,722 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 4632 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4632 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:49,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4632 Valid, 2014 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:49:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116571 states. [2025-03-03 14:49:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116571 to 77299. [2025-03-03 14:49:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77299 states, 77298 states have (on average 1.2428652746513493) internal successors, (96071), 77298 states have internal predecessors, (96071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77299 states to 77299 states and 96071 transitions. [2025-03-03 14:49:52,624 INFO L78 Accepts]: Start accepts. Automaton has 77299 states and 96071 transitions. Word has length 104 [2025-03-03 14:49:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 77299 states and 96071 transitions. [2025-03-03 14:49:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.703703703703704) internal successors, (262), 27 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 77299 states and 96071 transitions. [2025-03-03 14:49:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:49:52,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:52,632 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:49:52,639 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-03 14:49:52,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:52,833 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:52,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 433521274, now seen corresponding path program 1 times [2025-03-03 14:49:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438887187] [2025-03-03 14:49:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:52,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:49:52,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:49:52,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:52,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:49:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438887187] [2025-03-03 14:49:52,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438887187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:52,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:52,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164543812] [2025-03-03 14:49:52,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:52,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:52,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:52,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:52,873 INFO L87 Difference]: Start difference. First operand 77299 states and 96071 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:54,963 INFO L93 Difference]: Finished difference Result 105932 states and 131457 transitions. [2025-03-03 14:49:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:54,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-03 14:49:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:55,037 INFO L225 Difference]: With dead ends: 105932 [2025-03-03 14:49:55,037 INFO L226 Difference]: Without dead ends: 52799 [2025-03-03 14:49:55,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:55,064 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 25 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:55,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52799 states. [2025-03-03 14:49:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52799 to 43770. [2025-03-03 14:49:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43770 states, 43769 states have (on average 1.2366286641230095) internal successors, (54126), 43769 states have internal predecessors, (54126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43770 states to 43770 states and 54126 transitions. [2025-03-03 14:49:57,222 INFO L78 Accepts]: Start accepts. Automaton has 43770 states and 54126 transitions. Word has length 107 [2025-03-03 14:49:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:57,222 INFO L471 AbstractCegarLoop]: Abstraction has 43770 states and 54126 transitions. [2025-03-03 14:49:57,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 43770 states and 54126 transitions. [2025-03-03 14:49:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:49:57,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:57,227 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:57,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:49:57,227 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:57,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash -787242529, now seen corresponding path program 1 times [2025-03-03 14:49:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:57,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313741991] [2025-03-03 14:49:57,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:57,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:49:57,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:49:57,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:57,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:49:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313741991] [2025-03-03 14:49:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313741991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:57,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485742565] [2025-03-03 14:49:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:57,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:57,258 INFO L87 Difference]: Start difference. First operand 43770 states and 54126 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:58,753 INFO L93 Difference]: Finished difference Result 96115 states and 118626 transitions. [2025-03-03 14:49:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:58,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 108 [2025-03-03 14:49:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:58,816 INFO L225 Difference]: With dead ends: 96115 [2025-03-03 14:49:58,816 INFO L226 Difference]: Without dead ends: 52764 [2025-03-03 14:49:58,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:58,834 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:58,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52764 states. [2025-03-03 14:50:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52764 to 43511. [2025-03-03 14:50:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43511 states, 43510 states have (on average 1.197977476442197) internal successors, (52124), 43510 states have internal predecessors, (52124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:00,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43511 states to 43511 states and 52124 transitions. [2025-03-03 14:50:00,381 INFO L78 Accepts]: Start accepts. Automaton has 43511 states and 52124 transitions. Word has length 108 [2025-03-03 14:50:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:00,381 INFO L471 AbstractCegarLoop]: Abstraction has 43511 states and 52124 transitions. [2025-03-03 14:50:00,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 43511 states and 52124 transitions. [2025-03-03 14:50:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:50:00,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:00,388 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:00,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:50:00,388 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash -498834300, now seen corresponding path program 1 times [2025-03-03 14:50:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-03-03 14:50:00,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:00,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:50:00,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:50:00,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:00,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:50:00,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036302927] [2025-03-03 14:50:00,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036302927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:00,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:00,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305266305] [2025-03-03 14:50:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:00,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:00,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:00,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:00,430 INFO L87 Difference]: Start difference. First operand 43511 states and 52124 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:01,371 INFO L93 Difference]: Finished difference Result 63838 states and 76453 transitions. [2025-03-03 14:50:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:01,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 109 [2025-03-03 14:50:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:01,411 INFO L225 Difference]: With dead ends: 63838 [2025-03-03 14:50:01,411 INFO L226 Difference]: Without dead ends: 34978 [2025-03-03 14:50:01,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:01,435 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 23 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:01,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 195 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34978 states. [2025-03-03 14:50:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34978 to 33304. [2025-03-03 14:50:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33304 states, 33303 states have (on average 1.181485151487854) internal successors, (39347), 33303 states have internal predecessors, (39347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33304 states to 33304 states and 39347 transitions. [2025-03-03 14:50:02,693 INFO L78 Accepts]: Start accepts. Automaton has 33304 states and 39347 transitions. Word has length 109 [2025-03-03 14:50:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:02,694 INFO L471 AbstractCegarLoop]: Abstraction has 33304 states and 39347 transitions. [2025-03-03 14:50:02,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33304 states and 39347 transitions. [2025-03-03 14:50:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:50:02,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:02,699 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:02,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:50:02,699 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:02,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1830762918, now seen corresponding path program 1 times [2025-03-03 14:50:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:02,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297204913] [2025-03-03 14:50:02,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:02,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:02,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:50:02,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:50:02,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:02,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:50:02,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:02,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297204913] [2025-03-03 14:50:02,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297204913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:02,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141282132] [2025-03-03 14:50:02,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:02,755 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:02,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:50:02,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:50:02,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:50:02,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:02,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:02,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:50:02,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:50:02,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:50:03,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141282132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:03,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:03,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-03 14:50:03,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670656661] [2025-03-03 14:50:03,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:03,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:50:03,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:03,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:50:03,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:50:03,056 INFO L87 Difference]: Start difference. First operand 33304 states and 39347 transitions. Second operand has 15 states, 15 states have (on average 15.4) internal successors, (231), 15 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-03 14:50:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:03,997 INFO L93 Difference]: Finished difference Result 54197 states and 63883 transitions. [2025-03-03 14:50:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:50:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.4) internal successors, (231), 15 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) Word has length 109 [2025-03-03 14:50:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:04,032 INFO L225 Difference]: With dead ends: 54197 [2025-03-03 14:50:04,032 INFO L226 Difference]: Without dead ends: 25966 [2025-03-03 14:50:04,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:50:04,049 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 484 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:04,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 456 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25966 states. [2025-03-03 14:50:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25966 to 23238. [2025-03-03 14:50:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23238 states, 23237 states have (on average 1.172010156216379) internal successors, (27234), 23237 states have internal predecessors, (27234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23238 states to 23238 states and 27234 transitions. [2025-03-03 14:50:04,844 INFO L78 Accepts]: Start accepts. Automaton has 23238 states and 27234 transitions. Word has length 109 [2025-03-03 14:50:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:04,844 INFO L471 AbstractCegarLoop]: Abstraction has 23238 states and 27234 transitions. [2025-03-03 14:50:04,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.4) internal successors, (231), 15 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-03 14:50:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 23238 states and 27234 transitions. [2025-03-03 14:50:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:50:04,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:04,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:04,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:50:05,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:05,054 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash 524938365, now seen corresponding path program 1 times [2025-03-03 14:50:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213855754] [2025-03-03 14:50:05,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:05,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:50:05,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:50:05,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:05,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:05,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213855754] [2025-03-03 14:50:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213855754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:05,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316012619] [2025-03-03 14:50:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:05,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:05,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:05,862 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:05,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:50:05,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:50:05,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:50:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:05,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:05,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 14:50:05,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:07,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:09,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316012619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:09,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:09,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 22] total 58 [2025-03-03 14:50:09,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076995477] [2025-03-03 14:50:09,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:09,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-03 14:50:09,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:09,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-03 14:50:09,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3041, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 14:50:09,957 INFO L87 Difference]: Start difference. First operand 23238 states and 27234 transitions. Second operand has 58 states, 58 states have (on average 5.362068965517241) internal successors, (311), 58 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)