./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/hardware-verification-bv/btor2c-lazyMod.client_server.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:32:02,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:32:02,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:32:02,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:32:02,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:32:02,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:32:02,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:32:02,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:32:02,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:32:02,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:32:02,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:32:02,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:32:02,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:32:02,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:32:02,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:32:02,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:32:02,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:32:02,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:32:02,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:32:02,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:32:02,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:32:02,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:32:02,710 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ed0841be1ae1dee8e84f0ca737866704342db1241d2484eefbe911736856543 [2025-03-08 08:32:02,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:32:02,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:32:02,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:32:02,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:32:02,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:32:02,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c [2025-03-08 08:32:04,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8037a79/61dbbccd5f35465ba2a166be43ee1882/FLAGab6c53443 [2025-03-08 08:32:04,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:32:04,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.client_server.c [2025-03-08 08:32:04,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8037a79/61dbbccd5f35465ba2a166be43ee1882/FLAGab6c53443 [2025-03-08 08:32:04,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8037a79/61dbbccd5f35465ba2a166be43ee1882 [2025-03-08 08:32:04,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:32:04,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:32:04,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:32:04,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:32:04,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:32:04,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:32:04" (1/1) ... [2025-03-08 08:32:04,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f88293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:04, skipping insertion in model container [2025-03-08 08:32:04,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:32:04" (1/1) ... [2025-03-08 08:32:04,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:32:04,840 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/hardware-verification-bv/btor2c-lazyMod.client_server.c[1253,1266] [2025-03-08 08:32:04,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:32:04,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:32:04,946 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/hardware-verification-bv/btor2c-lazyMod.client_server.c[1253,1266] [2025-03-08 08:32:05,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:32:05,014 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:32:05,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05 WrapperNode [2025-03-08 08:32:05,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:32:05,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:32:05,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:32:05,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:32:05,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,109 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 860 [2025-03-08 08:32:05,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:32:05,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:32:05,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:32:05,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:32:05,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,170 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-08 08:32:05,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:32:05,234 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:32:05,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:32:05,235 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:32:05,235 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (1/1) ... [2025-03-08 08:32:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:32:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:05,261 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-08 08:32:05,265 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-08 08:32:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:32:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:32:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:32:05,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:32:05,409 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:32:05,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:32:06,267 INFO L? ?]: Removed 563 outVars from TransFormulas that were not future-live. [2025-03-08 08:32:06,268 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:32:06,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:32:06,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:32:06,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:32:06 BoogieIcfgContainer [2025-03-08 08:32:06,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:32:06,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:32:06,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:32:06,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:32:06,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:32:04" (1/3) ... [2025-03-08 08:32:06,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216b711d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:32:06, skipping insertion in model container [2025-03-08 08:32:06,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:32:05" (2/3) ... [2025-03-08 08:32:06,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216b711d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:32:06, skipping insertion in model container [2025-03-08 08:32:06,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:32:06" (3/3) ... [2025-03-08 08:32:06,320 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.client_server.c [2025-03-08 08:32:06,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:32:06,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.client_server.c that has 1 procedures, 210 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:32:06,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:32:06,387 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;@76f44acd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:32:06,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:32:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 208 states have (on average 1.4951923076923077) internal successors, (311), 209 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) [2025-03-08 08:32:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 08:32:06,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:06,399 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-08 08:32:06,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:06,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash -879294502, now seen corresponding path program 1 times [2025-03-08 08:32:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:06,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273905523] [2025-03-08 08:32:06,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:06,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:06,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 08:32:06,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 08:32:06,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:06,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:07,202 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-08 08:32:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:07,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273905523] [2025-03-08 08:32:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273905523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:32:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523534493] [2025-03-08 08:32:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:32:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:07,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:32:07,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:07,231 INFO L87 Difference]: Start difference. First operand has 210 states, 208 states have (on average 1.4951923076923077) internal successors, (311), 209 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) Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-08 08:32:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:07,416 INFO L93 Difference]: Finished difference Result 397 states and 591 transitions. [2025-03-08 08:32:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:07,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-08 08:32:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:07,431 INFO L225 Difference]: With dead ends: 397 [2025-03-08 08:32:07,432 INFO L226 Difference]: Without dead ends: 209 [2025-03-08 08:32:07,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:07,436 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:07,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:32:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-08 08:32:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-08 08:32:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.4855769230769231) internal successors, (309), 208 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 309 transitions. [2025-03-08 08:32:07,471 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 309 transitions. Word has length 41 [2025-03-08 08:32:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:07,471 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 309 transitions. [2025-03-08 08:32:07,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-08 08:32:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 309 transitions. [2025-03-08 08:32:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 08:32:07,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:07,473 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-08 08:32:07,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 08:32:07,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:07,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1483646417, now seen corresponding path program 1 times [2025-03-08 08:32:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:07,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063128308] [2025-03-08 08:32:07,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:07,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 08:32:07,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 08:32:07,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:07,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:07,770 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-08 08:32:07,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:07,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063128308] [2025-03-08 08:32:07,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063128308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:07,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:07,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:32:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975659120] [2025-03-08 08:32:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:07,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:32:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:07,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:32:07,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:07,772 INFO L87 Difference]: Start difference. First operand 209 states and 309 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-08 08:32:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:07,876 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2025-03-08 08:32:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:32:07,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-08 08:32:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:07,878 INFO L225 Difference]: With dead ends: 398 [2025-03-08 08:32:07,878 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 08:32:07,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:32:07,879 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:07,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 757 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:32:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 08:32:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-08 08:32:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.480952380952381) internal successors, (311), 210 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) [2025-03-08 08:32:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2025-03-08 08:32:07,891 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 42 [2025-03-08 08:32:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:07,891 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2025-03-08 08:32:07,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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-08 08:32:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2025-03-08 08:32:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 08:32:07,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:07,896 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-08 08:32:07,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:32:07,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:07,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1111856523, now seen corresponding path program 1 times [2025-03-08 08:32:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:07,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138987815] [2025-03-08 08:32:07,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:07,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 08:32:08,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 08:32:08,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:08,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:08,486 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-08 08:32:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138987815] [2025-03-08 08:32:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138987815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:08,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:08,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:32:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153258398] [2025-03-08 08:32:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:08,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:32:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:08,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:32:08,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:08,488 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:08,671 INFO L93 Difference]: Finished difference Result 408 states and 602 transitions. [2025-03-08 08:32:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:32:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 08:32:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:08,673 INFO L225 Difference]: With dead ends: 408 [2025-03-08 08:32:08,673 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 08:32:08,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:08,674 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 5 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:08,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1252 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 08:32:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2025-03-08 08:32:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4744186046511627) internal successors, (317), 215 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 317 transitions. [2025-03-08 08:32:08,688 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 317 transitions. Word has length 43 [2025-03-08 08:32:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:08,688 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 317 transitions. [2025-03-08 08:32:08,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 317 transitions. [2025-03-08 08:32:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 08:32:08,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:08,689 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-08 08:32:08,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:32:08,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:08,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash 989804998, now seen corresponding path program 1 times [2025-03-08 08:32:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:08,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098531175] [2025-03-08 08:32:08,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:08,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:08,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 08:32:08,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 08:32:08,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:08,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:09,057 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-08 08:32:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098531175] [2025-03-08 08:32:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098531175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670136030] [2025-03-08 08:32:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:09,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:09,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:09,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:09,059 INFO L87 Difference]: Start difference. First operand 216 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-08 08:32:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:09,224 INFO L93 Difference]: Finished difference Result 414 states and 608 transitions. [2025-03-08 08:32:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:09,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-08 08:32:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:09,225 INFO L225 Difference]: With dead ends: 414 [2025-03-08 08:32:09,226 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 08:32:09,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:09,227 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 277 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:09,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 713 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:32:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 08:32:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2025-03-08 08:32:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4678899082568808) internal successors, (320), 218 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2025-03-08 08:32:09,241 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 44 [2025-03-08 08:32:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:09,242 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2025-03-08 08:32:09,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-08 08:32:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2025-03-08 08:32:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 08:32:09,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:09,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:09,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 08:32:09,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1106748194, now seen corresponding path program 1 times [2025-03-08 08:32:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:09,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733383032] [2025-03-08 08:32:09,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 08:32:09,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 08:32:09,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:09,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:09,917 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-08 08:32:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733383032] [2025-03-08 08:32:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733383032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:32:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409506253] [2025-03-08 08:32:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:09,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:32:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:09,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:32:09,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:09,919 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:10,190 INFO L93 Difference]: Finished difference Result 557 states and 812 transitions. [2025-03-08 08:32:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:10,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-08 08:32:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:10,192 INFO L225 Difference]: With dead ends: 557 [2025-03-08 08:32:10,192 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 08:32:10,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:10,193 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 680 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:10,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 929 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 08:32:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 221. [2025-03-08 08:32:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4636363636363636) internal successors, (322), 220 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 322 transitions. [2025-03-08 08:32:10,200 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 322 transitions. Word has length 45 [2025-03-08 08:32:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:10,200 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 322 transitions. [2025-03-08 08:32:10,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 322 transitions. [2025-03-08 08:32:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 08:32:10,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:10,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:10,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 08:32:10,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:10,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1973882260, now seen corresponding path program 1 times [2025-03-08 08:32:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977602883] [2025-03-08 08:32:10,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:10,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:10,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 08:32:10,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 08:32:10,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:10,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:10,648 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-08 08:32:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:10,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977602883] [2025-03-08 08:32:10,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977602883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:10,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:10,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:32:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234192574] [2025-03-08 08:32:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:10,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:32:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:10,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:32:10,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:10,650 INFO L87 Difference]: Start difference. First operand 221 states and 322 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:10,831 INFO L93 Difference]: Finished difference Result 427 states and 623 transitions. [2025-03-08 08:32:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:32:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-08 08:32:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:10,832 INFO L225 Difference]: With dead ends: 427 [2025-03-08 08:32:10,833 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 08:32:10,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:10,833 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:10,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1240 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 08:32:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2025-03-08 08:32:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4598214285714286) internal successors, (327), 224 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 327 transitions. [2025-03-08 08:32:10,841 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 327 transitions. Word has length 45 [2025-03-08 08:32:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:10,841 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 327 transitions. [2025-03-08 08:32:10,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 327 transitions. [2025-03-08 08:32:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 08:32:10,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:10,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:10,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 08:32:10,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:10,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1747448793, now seen corresponding path program 1 times [2025-03-08 08:32:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524371807] [2025-03-08 08:32:10,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:10,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 08:32:10,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 08:32:10,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:11,319 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-08 08:32:11,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:11,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524371807] [2025-03-08 08:32:11,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524371807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:11,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:11,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:11,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443873909] [2025-03-08 08:32:11,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:11,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:11,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:11,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:11,321 INFO L87 Difference]: Start difference. First operand 225 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:11,531 INFO L93 Difference]: Finished difference Result 585 states and 850 transitions. [2025-03-08 08:32:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:11,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-08 08:32:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:11,532 INFO L225 Difference]: With dead ends: 585 [2025-03-08 08:32:11,533 INFO L226 Difference]: Without dead ends: 384 [2025-03-08 08:32:11,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:11,533 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 734 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:11,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 696 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-08 08:32:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 227. [2025-03-08 08:32:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4557522123893805) internal successors, (329), 226 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 329 transitions. [2025-03-08 08:32:11,540 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 329 transitions. Word has length 45 [2025-03-08 08:32:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:11,540 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 329 transitions. [2025-03-08 08:32:11,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 329 transitions. [2025-03-08 08:32:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 08:32:11,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:11,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:11,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 08:32:11,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:11,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash 631263165, now seen corresponding path program 1 times [2025-03-08 08:32:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917194877] [2025-03-08 08:32:11,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:11,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:11,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 08:32:11,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 08:32:11,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:11,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:11,874 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-08 08:32:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917194877] [2025-03-08 08:32:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917194877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:11,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:11,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:32:11,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323647395] [2025-03-08 08:32:11,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:11,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:32:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:11,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:32:11,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:11,876 INFO L87 Difference]: Start difference. First operand 227 states and 329 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:12,046 INFO L93 Difference]: Finished difference Result 437 states and 635 transitions. [2025-03-08 08:32:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:32:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 08:32:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:12,048 INFO L225 Difference]: With dead ends: 437 [2025-03-08 08:32:12,048 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 08:32:12,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:12,048 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:12,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1240 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 08:32:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 231. [2025-03-08 08:32:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4521739130434783) internal successors, (334), 230 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 334 transitions. [2025-03-08 08:32:12,056 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 334 transitions. Word has length 46 [2025-03-08 08:32:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:12,056 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 334 transitions. [2025-03-08 08:32:12,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 334 transitions. [2025-03-08 08:32:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 08:32:12,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:12,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:12,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 08:32:12,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -384860424, now seen corresponding path program 1 times [2025-03-08 08:32:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305619064] [2025-03-08 08:32:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:12,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 08:32:12,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 08:32:12,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:12,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:12,517 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-08 08:32:12,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305619064] [2025-03-08 08:32:12,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305619064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:12,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375991685] [2025-03-08 08:32:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:12,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:12,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:12,519 INFO L87 Difference]: Start difference. First operand 231 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:12,747 INFO L93 Difference]: Finished difference Result 617 states and 894 transitions. [2025-03-08 08:32:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:12,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 08:32:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:12,749 INFO L225 Difference]: With dead ends: 617 [2025-03-08 08:32:12,749 INFO L226 Difference]: Without dead ends: 412 [2025-03-08 08:32:12,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:12,750 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 794 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:12,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 700 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-08 08:32:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 236. [2025-03-08 08:32:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.4425531914893617) internal successors, (339), 235 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2025-03-08 08:32:12,757 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 46 [2025-03-08 08:32:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:12,757 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2025-03-08 08:32:12,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2025-03-08 08:32:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 08:32:12,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:12,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:12,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 08:32:12,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:12,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash 623302102, now seen corresponding path program 1 times [2025-03-08 08:32:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883966429] [2025-03-08 08:32:12,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:12,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:12,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 08:32:12,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 08:32:12,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:12,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:13,068 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-08 08:32:13,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883966429] [2025-03-08 08:32:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883966429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:32:13,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507054261] [2025-03-08 08:32:13,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:13,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:32:13,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:13,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:32:13,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:13,070 INFO L87 Difference]: Start difference. First operand 236 states and 339 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:13,239 INFO L93 Difference]: Finished difference Result 450 states and 650 transitions. [2025-03-08 08:32:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:32:13,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 08:32:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:13,241 INFO L225 Difference]: With dead ends: 450 [2025-03-08 08:32:13,241 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 08:32:13,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:13,241 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:13,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1240 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 08:32:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2025-03-08 08:32:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.4393305439330544) internal successors, (344), 239 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2025-03-08 08:32:13,246 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 47 [2025-03-08 08:32:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:13,246 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2025-03-08 08:32:13,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2025-03-08 08:32:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 08:32:13,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:13,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:13,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 08:32:13,247 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:13,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash -118695279, now seen corresponding path program 1 times [2025-03-08 08:32:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:13,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230417513] [2025-03-08 08:32:13,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:13,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 08:32:13,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 08:32:13,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:13,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:13,905 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-08 08:32:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230417513] [2025-03-08 08:32:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230417513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:13,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:13,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:32:13,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112819285] [2025-03-08 08:32:13,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:13,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:32:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:13,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:32:13,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:32:13,906 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:14,276 INFO L93 Difference]: Finished difference Result 559 states and 803 transitions. [2025-03-08 08:32:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:32:14,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 08:32:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:14,278 INFO L225 Difference]: With dead ends: 559 [2025-03-08 08:32:14,278 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 08:32:14,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:32:14,280 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 437 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:14,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1487 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:32:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 08:32:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 245. [2025-03-08 08:32:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4344262295081966) internal successors, (350), 244 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 350 transitions. [2025-03-08 08:32:14,289 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 350 transitions. Word has length 47 [2025-03-08 08:32:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:14,289 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 350 transitions. [2025-03-08 08:32:14,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 350 transitions. [2025-03-08 08:32:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 08:32:14,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:14,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:14,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 08:32:14,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 526893366, now seen corresponding path program 1 times [2025-03-08 08:32:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482645004] [2025-03-08 08:32:14,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:14,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 08:32:14,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 08:32:14,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:14,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:14,678 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-08 08:32:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482645004] [2025-03-08 08:32:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482645004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:14,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:32:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986165571] [2025-03-08 08:32:14,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:32:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:14,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:32:14,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:32:14,681 INFO L87 Difference]: Start difference. First operand 245 states and 350 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:14,916 INFO L93 Difference]: Finished difference Result 468 states and 673 transitions. [2025-03-08 08:32:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:32:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 08:32:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:14,918 INFO L225 Difference]: With dead ends: 468 [2025-03-08 08:32:14,918 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 08:32:14,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:32:14,919 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 9 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:14,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1746 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 08:32:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2025-03-08 08:32:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.4291338582677164) internal successors, (363), 254 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 363 transitions. [2025-03-08 08:32:14,925 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 363 transitions. Word has length 47 [2025-03-08 08:32:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:14,925 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 363 transitions. [2025-03-08 08:32:14,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 363 transitions. [2025-03-08 08:32:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 08:32:14,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:14,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:14,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 08:32:14,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2129978526, now seen corresponding path program 1 times [2025-03-08 08:32:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735136344] [2025-03-08 08:32:14,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:14,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 08:32:14,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 08:32:14,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:14,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:15,358 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-08 08:32:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:15,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735136344] [2025-03-08 08:32:15,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735136344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:15,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:15,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:32:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597138620] [2025-03-08 08:32:15,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:15,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:32:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:15,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:32:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:15,360 INFO L87 Difference]: Start difference. First operand 255 states and 363 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:15,605 INFO L93 Difference]: Finished difference Result 640 states and 921 transitions. [2025-03-08 08:32:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 08:32:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:15,607 INFO L225 Difference]: With dead ends: 640 [2025-03-08 08:32:15,607 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 08:32:15,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:32:15,608 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 762 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:15,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 930 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 08:32:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 263. [2025-03-08 08:32:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4198473282442747) internal successors, (372), 262 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 372 transitions. [2025-03-08 08:32:15,616 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 372 transitions. Word has length 48 [2025-03-08 08:32:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:15,616 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 372 transitions. [2025-03-08 08:32:15,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 372 transitions. [2025-03-08 08:32:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 08:32:15,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:15,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:15,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 08:32:15,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:15,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2128117465, now seen corresponding path program 1 times [2025-03-08 08:32:15,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:15,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403638174] [2025-03-08 08:32:15,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:15,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 08:32:15,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 08:32:15,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:15,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:15,895 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-08 08:32:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403638174] [2025-03-08 08:32:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403638174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:15,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:32:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420314216] [2025-03-08 08:32:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:15,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:32:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:15,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:32:15,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:15,897 INFO L87 Difference]: Start difference. First operand 263 states and 372 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:16,071 INFO L93 Difference]: Finished difference Result 491 states and 702 transitions. [2025-03-08 08:32:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:32:16,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 08:32:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:16,073 INFO L225 Difference]: With dead ends: 491 [2025-03-08 08:32:16,073 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 08:32:16,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:16,074 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 7 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:16,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1484 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 08:32:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2025-03-08 08:32:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.4172932330827068) internal successors, (377), 266 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2025-03-08 08:32:16,079 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 48 [2025-03-08 08:32:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:16,079 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2025-03-08 08:32:16,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2025-03-08 08:32:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 08:32:16,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:16,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 08:32:16,080 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:16,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash -727319064, now seen corresponding path program 1 times [2025-03-08 08:32:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:16,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962527816] [2025-03-08 08:32:16,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:16,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 08:32:16,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 08:32:16,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:16,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:16,583 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-08 08:32:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962527816] [2025-03-08 08:32:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962527816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:16,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 08:32:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445973426] [2025-03-08 08:32:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 08:32:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:16,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 08:32:16,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2025-03-08 08:32:16,584 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:17,310 INFO L93 Difference]: Finished difference Result 529 states and 754 transitions. [2025-03-08 08:32:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 08:32:17,311 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 08:32:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:17,312 INFO L225 Difference]: With dead ends: 529 [2025-03-08 08:32:17,312 INFO L226 Difference]: Without dead ends: 306 [2025-03-08 08:32:17,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2025-03-08 08:32:17,314 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 25 mSDsluCounter, 4058 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:17,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4300 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:32:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-08 08:32:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2025-03-08 08:32:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.42) internal successors, (426), 300 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 426 transitions. [2025-03-08 08:32:17,320 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 426 transitions. Word has length 48 [2025-03-08 08:32:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:17,320 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 426 transitions. [2025-03-08 08:32:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 426 transitions. [2025-03-08 08:32:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 08:32:17,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:17,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:17,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 08:32:17,321 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:17,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -586355183, now seen corresponding path program 1 times [2025-03-08 08:32:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927073766] [2025-03-08 08:32:17,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:17,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 08:32:17,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 08:32:17,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:17,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:17,719 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-08 08:32:17,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927073766] [2025-03-08 08:32:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927073766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:17,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:17,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 08:32:17,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594189100] [2025-03-08 08:32:17,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 08:32:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:17,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 08:32:17,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:32:17,721 INFO L87 Difference]: Start difference. First operand 301 states and 426 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:18,060 INFO L93 Difference]: Finished difference Result 561 states and 801 transitions. [2025-03-08 08:32:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 08:32:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 08:32:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:18,061 INFO L225 Difference]: With dead ends: 561 [2025-03-08 08:32:18,062 INFO L226 Difference]: Without dead ends: 301 [2025-03-08 08:32:18,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:32:18,063 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 14 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:18,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2481 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:32:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-08 08:32:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2025-03-08 08:32:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.419463087248322) internal successors, (423), 298 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 423 transitions. [2025-03-08 08:32:18,069 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 423 transitions. Word has length 48 [2025-03-08 08:32:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:18,069 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 423 transitions. [2025-03-08 08:32:18,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 423 transitions. [2025-03-08 08:32:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 08:32:18,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:18,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:18,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 08:32:18,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1773055237, now seen corresponding path program 1 times [2025-03-08 08:32:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314222910] [2025-03-08 08:32:18,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:18,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 08:32:18,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 08:32:18,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:18,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:18,544 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-08 08:32:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314222910] [2025-03-08 08:32:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314222910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:32:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675990840] [2025-03-08 08:32:18,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:18,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:32:18,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:18,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:32:18,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:18,546 INFO L87 Difference]: Start difference. First operand 299 states and 423 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:18,776 INFO L93 Difference]: Finished difference Result 670 states and 956 transitions. [2025-03-08 08:32:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:18,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 08:32:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:18,778 INFO L225 Difference]: With dead ends: 670 [2025-03-08 08:32:18,778 INFO L226 Difference]: Without dead ends: 412 [2025-03-08 08:32:18,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:32:18,779 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 599 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:18,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 929 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-08 08:32:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 307. [2025-03-08 08:32:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.411764705882353) internal successors, (432), 306 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 432 transitions. [2025-03-08 08:32:18,785 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 432 transitions. Word has length 49 [2025-03-08 08:32:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:18,785 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 432 transitions. [2025-03-08 08:32:18,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 432 transitions. [2025-03-08 08:32:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 08:32:18,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:18,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:18,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 08:32:18,785 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:18,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash -644275752, now seen corresponding path program 1 times [2025-03-08 08:32:18,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:18,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744281857] [2025-03-08 08:32:18,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:18,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:18,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 08:32:18,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 08:32:18,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:18,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:19,292 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-08 08:32:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744281857] [2025-03-08 08:32:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744281857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:19,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:19,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 08:32:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388506673] [2025-03-08 08:32:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:19,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 08:32:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:19,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 08:32:19,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-03-08 08:32:19,294 INFO L87 Difference]: Start difference. First operand 307 states and 432 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:19,927 INFO L93 Difference]: Finished difference Result 570 states and 810 transitions. [2025-03-08 08:32:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 08:32:19,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 08:32:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:19,929 INFO L225 Difference]: With dead ends: 570 [2025-03-08 08:32:19,929 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 08:32:19,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-03-08 08:32:19,930 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 24 mSDsluCounter, 3670 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3918 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:19,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3918 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:32:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 08:32:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-03-08 08:32:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4104234527687296) internal successors, (433), 307 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 433 transitions. [2025-03-08 08:32:19,938 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 433 transitions. Word has length 49 [2025-03-08 08:32:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:19,938 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 433 transitions. [2025-03-08 08:32:19,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2025-03-08 08:32:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 08:32:19,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:19,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:32:19,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 08:32:19,939 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:19,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash 243569011, now seen corresponding path program 1 times [2025-03-08 08:32:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:19,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111780274] [2025-03-08 08:32:19,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:19,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:19,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 08:32:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 08:32:20,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:20,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:20,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:20,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111780274] [2025-03-08 08:32:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111780274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:20,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 08:32:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922453759] [2025-03-08 08:32:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:20,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 08:32:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:20,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 08:32:20,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-08 08:32:20,415 INFO L87 Difference]: Start difference. First operand 308 states and 433 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:20,854 INFO L93 Difference]: Finished difference Result 571 states and 811 transitions. [2025-03-08 08:32:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 08:32:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 08:32:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:20,856 INFO L225 Difference]: With dead ends: 571 [2025-03-08 08:32:20,856 INFO L226 Difference]: Without dead ends: 309 [2025-03-08 08:32:20,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-08 08:32:20,856 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 19 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:20,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3210 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:32:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-08 08:32:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2025-03-08 08:32:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.4098360655737705) internal successors, (430), 305 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 430 transitions. [2025-03-08 08:32:20,861 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 430 transitions. Word has length 49 [2025-03-08 08:32:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:20,861 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 430 transitions. [2025-03-08 08:32:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 430 transitions. [2025-03-08 08:32:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 08:32:20,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:20,863 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 08:32:20,863 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:20,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1088380397, now seen corresponding path program 1 times [2025-03-08 08:32:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330971107] [2025-03-08 08:32:20,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:20,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 08:32:21,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 08:32:21,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:21,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 08:32:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330971107] [2025-03-08 08:32:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330971107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:32:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544761918] [2025-03-08 08:32:23,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:23,302 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-08 08:32:23,303 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-08 08:32:23,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 08:32:23,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 08:32:23,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:23,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:23,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 08:32:23,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:32:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:24,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:32:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544761918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:32:24,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2025-03-08 08:32:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730923460] [2025-03-08 08:32:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:24,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:32:24,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:24,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:32:24,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-08 08:32:24,304 INFO L87 Difference]: Start difference. First operand 306 states and 430 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:24,863 INFO L93 Difference]: Finished difference Result 764 states and 1096 transitions. [2025-03-08 08:32:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:32:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-03-08 08:32:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:24,865 INFO L225 Difference]: With dead ends: 764 [2025-03-08 08:32:24,865 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 08:32:24,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-03-08 08:32:24,866 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 972 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:24,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 690 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:32:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 08:32:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 334. [2025-03-08 08:32:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3993993993993994) internal successors, (466), 333 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 466 transitions. [2025-03-08 08:32:24,872 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 466 transitions. Word has length 143 [2025-03-08 08:32:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:24,872 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 466 transitions. [2025-03-08 08:32:24,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 466 transitions. [2025-03-08 08:32:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 08:32:24,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:24,875 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:24,886 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-08 08:32:25,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:25,076 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:25,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1920749217, now seen corresponding path program 1 times [2025-03-08 08:32:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397890171] [2025-03-08 08:32:25,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:25,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 08:32:25,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 08:32:25,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:25,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 08:32:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397890171] [2025-03-08 08:32:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397890171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:32:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149871877] [2025-03-08 08:32:29,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:29,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:29,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:29,254 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-08 08:32:29,255 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-08 08:32:29,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 08:32:29,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 08:32:29,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:29,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:29,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 08:32:29,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:32:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:30,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:32:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149871877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:32:30,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2025-03-08 08:32:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302714925] [2025-03-08 08:32:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:32:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:30,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:32:30,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-08 08:32:30,080 INFO L87 Difference]: Start difference. First operand 334 states and 466 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:30,409 INFO L93 Difference]: Finished difference Result 650 states and 924 transitions. [2025-03-08 08:32:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:32:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-03-08 08:32:30,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:30,411 INFO L225 Difference]: With dead ends: 650 [2025-03-08 08:32:30,411 INFO L226 Difference]: Without dead ends: 390 [2025-03-08 08:32:30,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-03-08 08:32:30,412 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 324 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:30,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 748 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:32:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-08 08:32:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 339. [2025-03-08 08:32:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.3964497041420119) internal successors, (472), 338 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 472 transitions. [2025-03-08 08:32:30,419 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 472 transitions. Word has length 144 [2025-03-08 08:32:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:30,419 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 472 transitions. [2025-03-08 08:32:30,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 472 transitions. [2025-03-08 08:32:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 08:32:30,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:30,421 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:30,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 08:32:30,625 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,SelfDestructingSolverStorable20 [2025-03-08 08:32:30,625 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1108644647, now seen corresponding path program 1 times [2025-03-08 08:32:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778189629] [2025-03-08 08:32:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:30,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 08:32:31,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 08:32:31,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:31,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:31,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778189629] [2025-03-08 08:32:31,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778189629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:31,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:31,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:32:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455010949] [2025-03-08 08:32:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:31,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:32:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:31,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:32:31,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:31,541 INFO L87 Difference]: Start difference. First operand 339 states and 472 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:31,835 INFO L93 Difference]: Finished difference Result 606 states and 855 transitions. [2025-03-08 08:32:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:32:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-08 08:32:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:31,839 INFO L225 Difference]: With dead ends: 606 [2025-03-08 08:32:31,839 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 08:32:31,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:32:31,840 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 248 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:31,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 662 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:32:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 08:32:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2025-03-08 08:32:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.3952802359882006) internal successors, (473), 339 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 473 transitions. [2025-03-08 08:32:31,848 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 473 transitions. Word has length 145 [2025-03-08 08:32:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:31,849 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 473 transitions. [2025-03-08 08:32:31,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 473 transitions. [2025-03-08 08:32:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 08:32:31,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:31,850 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:31,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 08:32:31,851 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:31,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash -976290260, now seen corresponding path program 1 times [2025-03-08 08:32:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634450611] [2025-03-08 08:32:31,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:31,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:31,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 08:32:32,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 08:32:32,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:32,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:32,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:32,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634450611] [2025-03-08 08:32:32,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634450611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:32,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:32,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:32:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523564234] [2025-03-08 08:32:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:32,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:32:32,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:32,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:32:32,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:32:32,720 INFO L87 Difference]: Start difference. First operand 340 states and 473 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:32,919 INFO L93 Difference]: Finished difference Result 727 states and 1033 transitions. [2025-03-08 08:32:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:32:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-08 08:32:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:32,920 INFO L225 Difference]: With dead ends: 727 [2025-03-08 08:32:32,921 INFO L226 Difference]: Without dead ends: 461 [2025-03-08 08:32:32,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:32:32,921 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 466 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:32,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1043 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-08 08:32:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 377. [2025-03-08 08:32:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.398936170212766) internal successors, (526), 376 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 526 transitions. [2025-03-08 08:32:32,928 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 526 transitions. Word has length 145 [2025-03-08 08:32:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:32,929 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 526 transitions. [2025-03-08 08:32:32,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 526 transitions. [2025-03-08 08:32:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 08:32:32,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:32,930 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:32,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 08:32:32,930 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1018636958, now seen corresponding path program 1 times [2025-03-08 08:32:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647532560] [2025-03-08 08:32:32,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:32,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 08:32:33,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 08:32:33,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:33,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 08:32:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647532560] [2025-03-08 08:32:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647532560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:32:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487764104] [2025-03-08 08:32:35,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:35,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:35,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:35,329 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-08 08:32:35,330 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-08 08:32:35,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 08:32:35,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 08:32:35,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:35,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:35,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-08 08:32:35,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:32:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:36,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:32:36,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487764104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:36,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:32:36,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2025-03-08 08:32:36,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129668619] [2025-03-08 08:32:36,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:36,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 08:32:36,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:36,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 08:32:36,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-08 08:32:36,648 INFO L87 Difference]: Start difference. First operand 377 states and 526 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:37,142 INFO L93 Difference]: Finished difference Result 785 states and 1117 transitions. [2025-03-08 08:32:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 08:32:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-03-08 08:32:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:37,144 INFO L225 Difference]: With dead ends: 785 [2025-03-08 08:32:37,144 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 08:32:37,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-08 08:32:37,145 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 615 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:37,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 951 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:32:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 08:32:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 408. [2025-03-08 08:32:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4004914004914004) internal successors, (570), 407 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 570 transitions. [2025-03-08 08:32:37,181 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 570 transitions. Word has length 145 [2025-03-08 08:32:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:37,181 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 570 transitions. [2025-03-08 08:32:37,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 570 transitions. [2025-03-08 08:32:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 08:32:37,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:37,182 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:37,198 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-08 08:32:37,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:37,383 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:37,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:37,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1518153690, now seen corresponding path program 1 times [2025-03-08 08:32:37,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:37,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056625299] [2025-03-08 08:32:37,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:37,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:37,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:37,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:37,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:37,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:38,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056625299] [2025-03-08 08:32:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056625299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:32:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895448117] [2025-03-08 08:32:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:32:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:38,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:32:38,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:32:38,698 INFO L87 Difference]: Start difference. First operand 408 states and 570 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:38,878 INFO L93 Difference]: Finished difference Result 679 states and 958 transitions. [2025-03-08 08:32:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:32:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-08 08:32:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:38,879 INFO L225 Difference]: With dead ends: 679 [2025-03-08 08:32:38,879 INFO L226 Difference]: Without dead ends: 406 [2025-03-08 08:32:38,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 08:32:38,880 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 2 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:38,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 827 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-08 08:32:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-08 08:32:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.3975308641975308) internal successors, (566), 405 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 566 transitions. [2025-03-08 08:32:38,891 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 566 transitions. Word has length 146 [2025-03-08 08:32:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:38,891 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 566 transitions. [2025-03-08 08:32:38,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 566 transitions. [2025-03-08 08:32:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 08:32:38,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:38,893 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:38,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 08:32:38,893 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:38,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:38,893 INFO L85 PathProgramCache]: Analyzing trace with hash 165720900, now seen corresponding path program 1 times [2025-03-08 08:32:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:38,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492727499] [2025-03-08 08:32:38,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:38,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:38,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:38,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:38,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:38,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492727499] [2025-03-08 08:32:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492727499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:32:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698417853] [2025-03-08 08:32:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:32:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:39,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:32:39,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:39,201 INFO L87 Difference]: Start difference. First operand 406 states and 566 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:39,417 INFO L93 Difference]: Finished difference Result 920 states and 1299 transitions. [2025-03-08 08:32:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:32:39,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-08 08:32:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:39,418 INFO L225 Difference]: With dead ends: 920 [2025-03-08 08:32:39,418 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 08:32:39,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:32:39,419 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 138 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:39,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1425 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 08:32:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 410. [2025-03-08 08:32:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.3936430317848412) internal successors, (570), 409 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2025-03-08 08:32:39,423 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 146 [2025-03-08 08:32:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:39,423 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2025-03-08 08:32:39,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2025-03-08 08:32:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 08:32:39,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:39,424 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:39,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 08:32:39,424 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:39,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash -990646396, now seen corresponding path program 1 times [2025-03-08 08:32:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:39,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090513789] [2025-03-08 08:32:39,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:39,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 08:32:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090513789] [2025-03-08 08:32:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090513789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:32:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95858719] [2025-03-08 08:32:41,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:41,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:41,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:41,583 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-08 08:32:41,585 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-08 08:32:41,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:42,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:42,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:42,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:42,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-08 08:32:42,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:32:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:42,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:32:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95858719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:32:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 31 [2025-03-08 08:32:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082494988] [2025-03-08 08:32:42,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:42,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 08:32:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:42,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 08:32:42,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2025-03-08 08:32:42,943 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:43,973 INFO L93 Difference]: Finished difference Result 917 states and 1297 transitions. [2025-03-08 08:32:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 08:32:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-08 08:32:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:43,975 INFO L225 Difference]: With dead ends: 917 [2025-03-08 08:32:43,975 INFO L226 Difference]: Without dead ends: 650 [2025-03-08 08:32:43,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 08:32:43,976 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1028 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:43,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2151 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 08:32:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-08 08:32:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 503. [2025-03-08 08:32:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.408366533864542) internal successors, (707), 502 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 707 transitions. [2025-03-08 08:32:43,983 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 707 transitions. Word has length 146 [2025-03-08 08:32:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:43,983 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 707 transitions. [2025-03-08 08:32:43,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 707 transitions. [2025-03-08 08:32:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 08:32:43,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:43,985 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:43,996 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-08 08:32:44,186 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,SelfDestructingSolverStorable26 [2025-03-08 08:32:44,186 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:44,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash -908422425, now seen corresponding path program 1 times [2025-03-08 08:32:44,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:44,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034513205] [2025-03-08 08:32:44,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:44,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:44,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:44,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:44,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:45,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034513205] [2025-03-08 08:32:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034513205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 08:32:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082762178] [2025-03-08 08:32:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 08:32:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:45,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 08:32:45,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 08:32:45,483 INFO L87 Difference]: Start difference. First operand 503 states and 707 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:45,814 INFO L93 Difference]: Finished difference Result 901 states and 1281 transitions. [2025-03-08 08:32:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 08:32:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-08 08:32:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:45,818 INFO L225 Difference]: With dead ends: 901 [2025-03-08 08:32:45,818 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 08:32:45,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-08 08:32:45,818 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 611 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:45,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1852 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:32:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 08:32:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 533. [2025-03-08 08:32:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.4078947368421053) internal successors, (749), 532 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 749 transitions. [2025-03-08 08:32:45,825 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 749 transitions. Word has length 146 [2025-03-08 08:32:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:45,825 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 749 transitions. [2025-03-08 08:32:45,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 749 transitions. [2025-03-08 08:32:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 08:32:45,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:45,827 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:45,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 08:32:45,827 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:45,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1327885913, now seen corresponding path program 1 times [2025-03-08 08:32:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:45,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296663119] [2025-03-08 08:32:45,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:45,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:45,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:46,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:46,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:46,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 08:32:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296663119] [2025-03-08 08:32:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296663119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:32:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072282878] [2025-03-08 08:32:48,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:48,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:48,107 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-08 08:32:48,108 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-08 08:32:48,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:48,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:48,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:48,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:48,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 08:32:48,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:32:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:49,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:32:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072282878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:49,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:32:49,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2025-03-08 08:32:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174861176] [2025-03-08 08:32:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:49,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:32:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:49,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:32:49,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-08 08:32:49,158 INFO L87 Difference]: Start difference. First operand 533 states and 749 transitions. Second operand has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:49,663 INFO L93 Difference]: Finished difference Result 881 states and 1248 transitions. [2025-03-08 08:32:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 08:32:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-08 08:32:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:49,665 INFO L225 Difference]: With dead ends: 881 [2025-03-08 08:32:49,665 INFO L226 Difference]: Without dead ends: 614 [2025-03-08 08:32:49,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-03-08 08:32:49,666 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 371 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:49,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 865 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:32:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-08 08:32:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 565. [2025-03-08 08:32:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.4095744680851063) internal successors, (795), 564 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 795 transitions. [2025-03-08 08:32:49,671 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 795 transitions. Word has length 146 [2025-03-08 08:32:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:49,671 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 795 transitions. [2025-03-08 08:32:49,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.22222222222222) internal successors, (146), 9 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 795 transitions. [2025-03-08 08:32:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 08:32:49,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:49,672 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:49,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 08:32:49,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 08:32:49,873 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:49,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1678580737, now seen corresponding path program 1 times [2025-03-08 08:32:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:49,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098284036] [2025-03-08 08:32:49,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:49,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:50,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:50,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:50,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:50,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098284036] [2025-03-08 08:32:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098284036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:50,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:50,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:32:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531830568] [2025-03-08 08:32:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:32:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:50,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:32:50,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:50,645 INFO L87 Difference]: Start difference. First operand 565 states and 795 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:50,886 INFO L93 Difference]: Finished difference Result 1056 states and 1498 transitions. [2025-03-08 08:32:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:32:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-08 08:32:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:50,888 INFO L225 Difference]: With dead ends: 1056 [2025-03-08 08:32:50,888 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 08:32:50,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:50,889 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 260 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:50,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 659 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 08:32:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2025-03-08 08:32:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.408450704225352) internal successors, (800), 568 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 800 transitions. [2025-03-08 08:32:50,896 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 800 transitions. Word has length 146 [2025-03-08 08:32:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:50,896 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 800 transitions. [2025-03-08 08:32:50,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 800 transitions. [2025-03-08 08:32:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 08:32:50,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:50,897 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:50,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 08:32:50,897 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:50,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1358518854, now seen corresponding path program 1 times [2025-03-08 08:32:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843626141] [2025-03-08 08:32:50,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:50,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 08:32:51,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 08:32:51,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:51,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843626141] [2025-03-08 08:32:51,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843626141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:32:51,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:32:51,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:32:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801807344] [2025-03-08 08:32:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:32:51,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:32:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:51,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:32:51,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:51,672 INFO L87 Difference]: Start difference. First operand 569 states and 800 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:51,899 INFO L93 Difference]: Finished difference Result 907 states and 1282 transitions. [2025-03-08 08:32:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 08:32:51,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-08 08:32:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:51,900 INFO L225 Difference]: With dead ends: 907 [2025-03-08 08:32:51,900 INFO L226 Difference]: Without dead ends: 494 [2025-03-08 08:32:51,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:32:51,901 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 246 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:51,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 661 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:32:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-08 08:32:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 478. [2025-03-08 08:32:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.3962264150943395) internal successors, (666), 477 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-08 08:32:51,905 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 146 [2025-03-08 08:32:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:51,905 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-08 08:32:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-08 08:32:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 08:32:51,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:51,906 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:51,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 08:32:51,906 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1120949937, now seen corresponding path program 1 times [2025-03-08 08:32:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701474663] [2025-03-08 08:32:51,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:51,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 08:32:52,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 08:32:52,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:52,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:54,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:32:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701474663] [2025-03-08 08:32:54,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701474663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:32:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301241352] [2025-03-08 08:32:54,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:54,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:54,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:32:54,017 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-08 08:32:54,018 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-08 08:32:54,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 08:32:54,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 08:32:54,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:54,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:32:54,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-08 08:32:54,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:32:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:55,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:32:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:32:56,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301241352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:32:56,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:32:56,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 35 [2025-03-08 08:32:56,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193829364] [2025-03-08 08:32:56,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:32:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 08:32:56,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:32:56,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 08:32:56,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 08:32:56,338 INFO L87 Difference]: Start difference. First operand 478 states and 666 transitions. Second operand has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:32:57,639 INFO L93 Difference]: Finished difference Result 1199 states and 1689 transitions. [2025-03-08 08:32:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 08:32:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 states have internal predecessors, (379), 0 states have call successors, (0), 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 147 [2025-03-08 08:32:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:32:57,642 INFO L225 Difference]: With dead ends: 1199 [2025-03-08 08:32:57,642 INFO L226 Difference]: Without dead ends: 897 [2025-03-08 08:32:57,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=407, Invalid=2043, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 08:32:57,643 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1159 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:32:57,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 2397 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 08:32:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-03-08 08:32:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 767. [2025-03-08 08:32:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4046997389033942) internal successors, (1076), 766 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1076 transitions. [2025-03-08 08:32:57,651 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1076 transitions. Word has length 147 [2025-03-08 08:32:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:32:57,651 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1076 transitions. [2025-03-08 08:32:57,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.82857142857143) internal successors, (379), 35 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:32:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1076 transitions. [2025-03-08 08:32:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 08:32:57,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:32:57,653 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:32:57,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 08:32:57,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:32:57,854 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:32:57,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:32:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1733247050, now seen corresponding path program 1 times [2025-03-08 08:32:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:32:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428819602] [2025-03-08 08:32:57,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:32:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:32:57,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 08:32:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 08:32:58,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:32:58,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 08:33:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428819602] [2025-03-08 08:33:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428819602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:33:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035899985] [2025-03-08 08:33:00,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:00,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:33:00,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:33:00,242 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-08 08:33:00,242 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-08 08:33:00,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 08:33:01,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 08:33:01,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:01,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:01,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-03-08 08:33:01,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:33:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:33:02,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:33:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:33:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035899985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:33:03,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:33:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 22] total 55 [2025-03-08 08:33:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365253877] [2025-03-08 08:33:03,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:33:03,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 08:33:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:03,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 08:33:03,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2633, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 08:33:03,934 INFO L87 Difference]: Start difference. First operand 767 states and 1076 transitions. Second operand has 55 states, 55 states have (on average 7.0181818181818185) internal successors, (386), 55 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:33:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:10,821 INFO L93 Difference]: Finished difference Result 5164 states and 7341 transitions. [2025-03-08 08:33:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-08 08:33:10,821 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.0181818181818185) internal successors, (386), 55 states have internal predecessors, (386), 0 states have call successors, (0), 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 147 [2025-03-08 08:33:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:10,830 INFO L225 Difference]: With dead ends: 5164 [2025-03-08 08:33:10,830 INFO L226 Difference]: Without dead ends: 4519 [2025-03-08 08:33:10,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10620 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2784, Invalid=29078, Unknown=0, NotChecked=0, Total=31862 [2025-03-08 08:33:10,836 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 7895 mSDsluCounter, 5460 mSDsCounter, 0 mSdLazyCounter, 8292 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7895 SdHoareTripleChecker+Valid, 5644 SdHoareTripleChecker+Invalid, 8367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 8292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:10,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7895 Valid, 5644 Invalid, 8367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 8292 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 08:33:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2025-03-08 08:33:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 1988. [2025-03-08 08:33:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1987 states have (on average 1.4247609461499748) internal successors, (2831), 1987 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:33:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2831 transitions. [2025-03-08 08:33:10,864 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2831 transitions. Word has length 147 [2025-03-08 08:33:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:10,864 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 2831 transitions. [2025-03-08 08:33:10,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.0181818181818185) internal successors, (386), 55 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:33:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2831 transitions. [2025-03-08 08:33:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 08:33:10,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:10,866 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:33:10,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 08:33:11,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:33:11,067 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -919062462, now seen corresponding path program 1 times [2025-03-08 08:33:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45736871] [2025-03-08 08:33:11,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:11,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 08:33:11,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 08:33:11,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:11,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:33:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:11,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45736871] [2025-03-08 08:33:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45736871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:33:11,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:33:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:33:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612529985] [2025-03-08 08:33:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:33:11,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:33:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:11,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:33:11,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:11,399 INFO L87 Difference]: Start difference. First operand 1988 states and 2831 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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-08 08:33:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:33:11,575 INFO L93 Difference]: Finished difference Result 2845 states and 4067 transitions. [2025-03-08 08:33:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:33:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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 148 [2025-03-08 08:33:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:33:11,579 INFO L225 Difference]: With dead ends: 2845 [2025-03-08 08:33:11,579 INFO L226 Difference]: Without dead ends: 2008 [2025-03-08 08:33:11,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:33:11,580 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 294 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:33:11,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 500 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:33:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2025-03-08 08:33:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 2008. [2025-03-08 08:33:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 2007 states have (on average 1.4205281514698556) internal successors, (2851), 2007 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:33:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2851 transitions. [2025-03-08 08:33:11,597 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2851 transitions. Word has length 148 [2025-03-08 08:33:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:33:11,597 INFO L471 AbstractCegarLoop]: Abstraction has 2008 states and 2851 transitions. [2025-03-08 08:33:11,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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-08 08:33:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2851 transitions. [2025-03-08 08:33:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 08:33:11,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:33:11,599 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:33:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 08:33:11,599 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:33:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:33:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 55393609, now seen corresponding path program 1 times [2025-03-08 08:33:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:33:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175061196] [2025-03-08 08:33:11,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:33:11,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 08:33:12,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 08:33:12,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:12,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:33:13,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:33:13,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175061196] [2025-03-08 08:33:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175061196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:33:13,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940266771] [2025-03-08 08:33:13,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:33:13,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:33:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:33:13,890 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-08 08:33:13,891 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-08 08:33:14,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 08:33:14,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 08:33:14,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:33:14,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:33:14,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 244 conjuncts are in the unsatisfiable core [2025-03-08 08:33:14,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:33:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:33:16,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:33:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:33:19,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940266771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:33:19,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:33:19,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 32, 28] total 71 [2025-03-08 08:33:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310337027] [2025-03-08 08:33:19,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:33:19,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-08 08:33:19,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:33:19,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-08 08:33:19,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=4458, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 08:33:19,872 INFO L87 Difference]: Start difference. First operand 2008 states and 2851 transitions. Second operand has 71 states, 71 states have (on average 5.605633802816901) internal successors, (398), 71 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)