./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.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.zaher.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 6fd8c0f78f1a02f0110655a19aab6ed326f45dcdd8f1755f6a67e81d29b9a49c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:44:40,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:44:40,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:44:40,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:44:40,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:44:40,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:44:40,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:44:40,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:44:40,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:44:40,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:44:40,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:44:40,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:44:40,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:44:40,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:44:40,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:44:40,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:40,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:44:40,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:44:40,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:44:40,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:44:40,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:44:40,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:44:40,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:44:40,134 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 -> 6fd8c0f78f1a02f0110655a19aab6ed326f45dcdd8f1755f6a67e81d29b9a49c [2025-03-08 09:44:40,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:44:40,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:44:40,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:44:40,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:44:40,369 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:44:40,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c [2025-03-08 09:44:41,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c527ebe/377acb465be44b3b87dc1637f13af8d2/FLAG56ff45fff [2025-03-08 09:44:41,714 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:44:41,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c [2025-03-08 09:44:41,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c527ebe/377acb465be44b3b87dc1637f13af8d2/FLAG56ff45fff [2025-03-08 09:44:41,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c527ebe/377acb465be44b3b87dc1637f13af8d2 [2025-03-08 09:44:41,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:44:41,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:44:41,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:41,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:44:41,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:44:41,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:41" (1/1) ... [2025-03-08 09:44:41,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:41, skipping insertion in model container [2025-03-08 09:44:41,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:44:41" (1/1) ... [2025-03-08 09:44:41,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:44:41,865 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.zaher.c[1245,1258] [2025-03-08 09:44:41,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:41,998 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:44:42,009 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.zaher.c[1245,1258] [2025-03-08 09:44:42,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:44:42,086 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:44:42,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42 WrapperNode [2025-03-08 09:44:42,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:44:42,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:42,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:44:42,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:44:42,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,158 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 777 [2025-03-08 09:44:42,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:44:42,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:44:42,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:44:42,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:44:42,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,219 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 09:44:42,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:44:42,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:44:42,280 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:44:42,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:44:42,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (1/1) ... [2025-03-08 09:44:42,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:44:42,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:42,307 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 09:44:42,312 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 09:44:42,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:44:42,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:44:42,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 09:44:42,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:44:42,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:44:42,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:44:42,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:44:43,140 INFO L? ?]: Removed 340 outVars from TransFormulas that were not future-live. [2025-03-08 09:44:43,141 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:44:43,178 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:44:43,181 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:44:43,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:43 BoogieIcfgContainer [2025-03-08 09:44:43,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:44:43,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:44:43,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:44:43,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:44:43,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:44:41" (1/3) ... [2025-03-08 09:44:43,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182bb616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:43, skipping insertion in model container [2025-03-08 09:44:43,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:44:42" (2/3) ... [2025-03-08 09:44:43,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182bb616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:44:43, skipping insertion in model container [2025-03-08 09:44:43,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:43" (3/3) ... [2025-03-08 09:44:43,190 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.zaher.c [2025-03-08 09:44:43,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:44:43,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.zaher.c that has 1 procedures, 182 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:44:43,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:44:43,250 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;@291ef658, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:44:43,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:44:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 09:44:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 09:44:43,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:43,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:43,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:43,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2028554902, now seen corresponding path program 1 times [2025-03-08 09:44:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495500782] [2025-03-08 09:44:43,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 09:44:43,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 09:44:43,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:43,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:43,831 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 09:44:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495500782] [2025-03-08 09:44:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495500782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:43,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:43,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907012402] [2025-03-08 09:44:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:43,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:43,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:43,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:43,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:43,854 INFO L87 Difference]: Start difference. First operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 0 states have call successors, (0), 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 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:43,993 INFO L93 Difference]: Finished difference Result 305 states and 453 transitions. [2025-03-08 09:44:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 09:44:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:44,002 INFO L225 Difference]: With dead ends: 305 [2025-03-08 09:44:44,003 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 09:44:44,005 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 09:44:44,009 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:44,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 09:44:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-08 09:44:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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 09:44:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2025-03-08 09:44:44,048 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 53 [2025-03-08 09:44:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:44,048 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2025-03-08 09:44:44,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2025-03-08 09:44:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 09:44:44,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:44,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:44,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:44:44,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:44,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1534628200, now seen corresponding path program 1 times [2025-03-08 09:44:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:44,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531235158] [2025-03-08 09:44:44,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:44,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 09:44:44,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 09:44:44,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:44,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:44,259 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 09:44:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531235158] [2025-03-08 09:44:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531235158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:44,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589281874] [2025-03-08 09:44:44,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:44,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:44,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:44,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:44,261 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 09:44:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:44,383 INFO L93 Difference]: Finished difference Result 306 states and 451 transitions. [2025-03-08 09:44:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-08 09:44:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:44,384 INFO L225 Difference]: With dead ends: 306 [2025-03-08 09:44:44,387 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 09:44:44,387 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 09:44:44,388 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:44,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 09:44:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-08 09:44:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.478021978021978) internal successors, (269), 182 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 09:44:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2025-03-08 09:44:44,398 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 54 [2025-03-08 09:44:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:44,398 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2025-03-08 09:44:44,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 09:44:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2025-03-08 09:44:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 09:44:44,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:44,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:44:44,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:44,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1602675409, now seen corresponding path program 1 times [2025-03-08 09:44:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612530012] [2025-03-08 09:44:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:44,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 09:44:44,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 09:44:44,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:44,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:44,747 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 09:44:44,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:44,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612530012] [2025-03-08 09:44:44,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612530012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:44,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937440752] [2025-03-08 09:44:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:44,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:44,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:44,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:44,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:44,748 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:44,920 INFO L93 Difference]: Finished difference Result 372 states and 544 transitions. [2025-03-08 09:44:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 09:44:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:44,921 INFO L225 Difference]: With dead ends: 372 [2025-03-08 09:44:44,922 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 09:44:44,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 09:44:44,922 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 406 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:44,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 630 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 09:44:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 190. [2025-03-08 09:44:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.470899470899471) internal successors, (278), 189 states have internal predecessors, (278), 0 states have call successors, (0), 0 states 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 09:44:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 278 transitions. [2025-03-08 09:44:44,936 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 278 transitions. Word has length 55 [2025-03-08 09:44:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:44,936 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 278 transitions. [2025-03-08 09:44:44,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 278 transitions. [2025-03-08 09:44:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 09:44:44,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:44,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:44,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:44:44,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1302148731, now seen corresponding path program 1 times [2025-03-08 09:44:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496326018] [2025-03-08 09:44:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:44,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 09:44:44,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 09:44:44,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:44,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:45,238 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 09:44:45,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:45,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496326018] [2025-03-08 09:44:45,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496326018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:45,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:45,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363898993] [2025-03-08 09:44:45,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:45,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:45,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:45,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:45,240 INFO L87 Difference]: Start difference. First operand 190 states and 278 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 09:44:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:45,451 INFO L93 Difference]: Finished difference Result 384 states and 560 transitions. [2025-03-08 09:44:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:45,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-08 09:44:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:45,453 INFO L225 Difference]: With dead ends: 384 [2025-03-08 09:44:45,453 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 09:44:45,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:44:45,455 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 438 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:45,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 922 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 09:44:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 192. [2025-03-08 09:44:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 191 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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 09:44:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 280 transitions. [2025-03-08 09:44:45,466 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 280 transitions. Word has length 56 [2025-03-08 09:44:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:45,466 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 280 transitions. [2025-03-08 09:44:45,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 09:44:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 280 transitions. [2025-03-08 09:44:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 09:44:45,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:45,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:45,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:44:45,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:45,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:45,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2102838636, now seen corresponding path program 1 times [2025-03-08 09:44:45,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:45,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212974302] [2025-03-08 09:44:45,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:45,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:45,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 09:44:45,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 09:44:45,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:45,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:45,728 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 09:44:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212974302] [2025-03-08 09:44:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212974302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:45,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909736335] [2025-03-08 09:44:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:45,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:45,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:45,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:45,730 INFO L87 Difference]: Start difference. First operand 192 states and 280 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:45,917 INFO L93 Difference]: Finished difference Result 368 states and 535 transitions. [2025-03-08 09:44:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:45,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-08 09:44:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:45,920 INFO L225 Difference]: With dead ends: 368 [2025-03-08 09:44:45,921 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 09:44:45,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:44:45,922 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 385 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:45,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 891 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 09:44:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 195. [2025-03-08 09:44:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 194 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 09:44:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2025-03-08 09:44:45,933 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 57 [2025-03-08 09:44:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:45,934 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2025-03-08 09:44:45,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2025-03-08 09:44:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 09:44:45,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:45,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:45,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:44:45,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:45,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash 762715318, now seen corresponding path program 1 times [2025-03-08 09:44:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190760375] [2025-03-08 09:44:45,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:45,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 09:44:45,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 09:44:45,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:45,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:46,092 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 09:44:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190760375] [2025-03-08 09:44:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190760375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481048835] [2025-03-08 09:44:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:46,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:46,094 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 09:44:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:46,187 INFO L93 Difference]: Finished difference Result 322 states and 470 transitions. [2025-03-08 09:44:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 09:44:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:46,191 INFO L225 Difference]: With dead ends: 322 [2025-03-08 09:44:46,191 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 09:44:46,192 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 09:44:46,192 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:46,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 09:44:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 09:44:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 196 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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 09:44:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 286 transitions. [2025-03-08 09:44:46,201 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 286 transitions. Word has length 58 [2025-03-08 09:44:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:46,201 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 286 transitions. [2025-03-08 09:44:46,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 09:44:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 286 transitions. [2025-03-08 09:44:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 09:44:46,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:46,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:46,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:44:46,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:46,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash -237266280, now seen corresponding path program 1 times [2025-03-08 09:44:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:46,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478862584] [2025-03-08 09:44:46,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:46,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 09:44:46,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 09:44:46,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:46,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:46,330 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 09:44:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478862584] [2025-03-08 09:44:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478862584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:46,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:46,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:46,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643935085] [2025-03-08 09:44:46,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:46,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:46,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:46,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:46,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:46,332 INFO L87 Difference]: Start difference. First operand 197 states and 286 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:46,420 INFO L93 Difference]: Finished difference Result 326 states and 474 transitions. [2025-03-08 09:44:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-08 09:44:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:46,422 INFO L225 Difference]: With dead ends: 326 [2025-03-08 09:44:46,422 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 09:44:46,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:46,422 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:46,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 09:44:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 09:44:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.4545454545454546) internal successors, (288), 198 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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 09:44:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 288 transitions. [2025-03-08 09:44:46,427 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 288 transitions. Word has length 59 [2025-03-08 09:44:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:46,427 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 288 transitions. [2025-03-08 09:44:46,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 288 transitions. [2025-03-08 09:44:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 09:44:46,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:46,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:46,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:44:46,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:46,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1934477489, now seen corresponding path program 1 times [2025-03-08 09:44:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:46,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193347105] [2025-03-08 09:44:46,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:46,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 09:44:46,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 09:44:46,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:46,534 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 09:44:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193347105] [2025-03-08 09:44:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193347105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:46,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:46,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:46,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003048275] [2025-03-08 09:44:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:46,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:46,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:46,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:46,536 INFO L87 Difference]: Start difference. First operand 199 states and 288 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:46,623 INFO L93 Difference]: Finished difference Result 330 states and 478 transitions. [2025-03-08 09:44:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:46,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 09:44:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:46,624 INFO L225 Difference]: With dead ends: 330 [2025-03-08 09:44:46,624 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 09:44:46,624 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 09:44:46,626 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:46,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 09:44:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-08 09:44:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.45) internal successors, (290), 200 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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 09:44:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 290 transitions. [2025-03-08 09:44:46,630 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 290 transitions. Word has length 60 [2025-03-08 09:44:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:46,631 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 290 transitions. [2025-03-08 09:44:46,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 290 transitions. [2025-03-08 09:44:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 09:44:46,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:46,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:46,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:44:46,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash -292286435, now seen corresponding path program 1 times [2025-03-08 09:44:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:46,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662660264] [2025-03-08 09:44:46,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:46,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 09:44:46,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 09:44:46,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:46,757 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 09:44:46,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:46,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662660264] [2025-03-08 09:44:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662660264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:46,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:46,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:46,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705328217] [2025-03-08 09:44:46,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:46,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:46,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:46,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:46,760 INFO L87 Difference]: Start difference. First operand 201 states and 290 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:46,853 INFO L93 Difference]: Finished difference Result 334 states and 482 transitions. [2025-03-08 09:44:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:46,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-08 09:44:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:46,854 INFO L225 Difference]: With dead ends: 334 [2025-03-08 09:44:46,854 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 09:44:46,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:46,855 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:46,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 09:44:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 09:44:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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 09:44:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2025-03-08 09:44:46,863 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 61 [2025-03-08 09:44:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:46,863 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2025-03-08 09:44:46,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2025-03-08 09:44:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 09:44:46,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:46,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:44:46,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 09:44:46,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1903996332, now seen corresponding path program 1 times [2025-03-08 09:44:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41356919] [2025-03-08 09:44:46,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:46,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 09:44:46,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 09:44:46,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:46,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:47,004 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 09:44:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41356919] [2025-03-08 09:44:47,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41356919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666634822] [2025-03-08 09:44:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:47,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:47,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:47,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:47,007 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:47,146 INFO L93 Difference]: Finished difference Result 384 states and 548 transitions. [2025-03-08 09:44:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:44:47,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-08 09:44:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:47,148 INFO L225 Difference]: With dead ends: 384 [2025-03-08 09:44:47,148 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 09:44:47,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:44:47,148 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 378 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:47,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 846 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 09:44:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2025-03-08 09:44:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.4401913875598087) internal successors, (301), 209 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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 09:44:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2025-03-08 09:44:47,152 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 62 [2025-03-08 09:44:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:47,153 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2025-03-08 09:44:47,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:44:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2025-03-08 09:44:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 09:44:47,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:47,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:47,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 09:44:47,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:47,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1246204724, now seen corresponding path program 1 times [2025-03-08 09:44:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910190445] [2025-03-08 09:44:47,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:47,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 09:44:47,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 09:44:47,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:47,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 09:44:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910190445] [2025-03-08 09:44:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910190445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:47,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:47,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890098995] [2025-03-08 09:44:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:47,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:47,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:47,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:47,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:47,461 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 09:44:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:47,562 INFO L93 Difference]: Finished difference Result 347 states and 497 transitions. [2025-03-08 09:44:47,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:47,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 123 [2025-03-08 09:44:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:47,564 INFO L225 Difference]: With dead ends: 347 [2025-03-08 09:44:47,564 INFO L226 Difference]: Without dead ends: 214 [2025-03-08 09:44:47,564 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 09:44:47,564 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:47,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-08 09:44:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2025-03-08 09:44:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.4401913875598087) internal successors, (301), 209 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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 09:44:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2025-03-08 09:44:47,569 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 123 [2025-03-08 09:44:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2025-03-08 09:44:47,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 09:44:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2025-03-08 09:44:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 09:44:47,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:47,570 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:44:47,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:47,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 825499674, now seen corresponding path program 1 times [2025-03-08 09:44:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216031305] [2025-03-08 09:44:47,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:47,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 09:44:47,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 09:44:47,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:47,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 09:44:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:47,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216031305] [2025-03-08 09:44:47,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216031305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:47,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:47,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759788745] [2025-03-08 09:44:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:47,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:47,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:47,879 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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 09:44:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:47,965 INFO L93 Difference]: Finished difference Result 347 states and 497 transitions. [2025-03-08 09:44:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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 124 [2025-03-08 09:44:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:47,966 INFO L225 Difference]: With dead ends: 347 [2025-03-08 09:44:47,966 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 09:44:47,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:47,967 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:47,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 09:44:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-08 09:44:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.4360189573459716) internal successors, (303), 211 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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 09:44:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 303 transitions. [2025-03-08 09:44:47,976 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 303 transitions. Word has length 124 [2025-03-08 09:44:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:47,976 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 303 transitions. [2025-03-08 09:44:47,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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 09:44:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 303 transitions. [2025-03-08 09:44:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 09:44:47,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:47,977 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:47,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:44:47,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:47,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash -347578577, now seen corresponding path program 1 times [2025-03-08 09:44:47,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:47,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506974874] [2025-03-08 09:44:47,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:48,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 09:44:48,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 09:44:48,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:48,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 09:44:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506974874] [2025-03-08 09:44:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506974874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688794648] [2025-03-08 09:44:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:48,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:48,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:48,270 INFO L87 Difference]: Start difference. First operand 212 states and 303 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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 09:44:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:48,364 INFO L93 Difference]: Finished difference Result 351 states and 501 transitions. [2025-03-08 09:44:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:48,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 125 [2025-03-08 09:44:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:48,365 INFO L225 Difference]: With dead ends: 351 [2025-03-08 09:44:48,365 INFO L226 Difference]: Without dead ends: 214 [2025-03-08 09:44:48,365 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 09:44:48,365 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:48,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-08 09:44:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-08 09:44:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.431924882629108) internal successors, (305), 213 states have internal predecessors, (305), 0 states have call successors, (0), 0 states 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 09:44:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 305 transitions. [2025-03-08 09:44:48,372 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 305 transitions. Word has length 125 [2025-03-08 09:44:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:48,372 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 305 transitions. [2025-03-08 09:44:48,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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 09:44:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 305 transitions. [2025-03-08 09:44:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 09:44:48,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:48,373 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:48,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 09:44:48,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:48,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1533363615, now seen corresponding path program 1 times [2025-03-08 09:44:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:48,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640605958] [2025-03-08 09:44:48,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:48,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:48,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 09:44:48,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 09:44:48,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:48,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:48,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640605958] [2025-03-08 09:44:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640605958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:48,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:48,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425666987] [2025-03-08 09:44:48,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:48,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:48,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:48,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:48,907 INFO L87 Difference]: Start difference. First operand 214 states and 305 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 09:44:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:49,092 INFO L93 Difference]: Finished difference Result 419 states and 594 transitions. [2025-03-08 09:44:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:49,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-08 09:44:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:49,094 INFO L225 Difference]: With dead ends: 419 [2025-03-08 09:44:49,094 INFO L226 Difference]: Without dead ends: 280 [2025-03-08 09:44:49,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:44:49,094 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 414 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:49,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1049 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-08 09:44:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 257. [2025-03-08 09:44:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.41015625) internal successors, (361), 256 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 09:44:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 361 transitions. [2025-03-08 09:44:49,099 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 361 transitions. Word has length 126 [2025-03-08 09:44:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 361 transitions. [2025-03-08 09:44:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 09:44:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 361 transitions. [2025-03-08 09:44:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 09:44:49,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:49,102 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:49,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 09:44:49,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:49,102 INFO L85 PathProgramCache]: Analyzing trace with hash -65477584, now seen corresponding path program 1 times [2025-03-08 09:44:49,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155539927] [2025-03-08 09:44:49,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:49,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 09:44:49,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 09:44:49,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:49,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:49,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:49,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155539927] [2025-03-08 09:44:49,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155539927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:49,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:49,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:49,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936792316] [2025-03-08 09:44:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:49,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:49,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:49,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:49,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:49,403 INFO L87 Difference]: Start difference. First operand 257 states and 361 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 09:44:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:49,571 INFO L93 Difference]: Finished difference Result 400 states and 564 transitions. [2025-03-08 09:44:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-08 09:44:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:49,572 INFO L225 Difference]: With dead ends: 400 [2025-03-08 09:44:49,572 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 09:44:49,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:49,573 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:49,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 797 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 09:44:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-08 09:44:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.4038461538461537) internal successors, (365), 260 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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 09:44:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 365 transitions. [2025-03-08 09:44:49,578 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 365 transitions. Word has length 127 [2025-03-08 09:44:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:49,578 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 365 transitions. [2025-03-08 09:44:49,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 09:44:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 365 transitions. [2025-03-08 09:44:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 09:44:49,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:49,581 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:49,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 09:44:49,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:49,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:49,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1730161170, now seen corresponding path program 1 times [2025-03-08 09:44:49,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:49,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580688748] [2025-03-08 09:44:49,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:49,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 09:44:49,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 09:44:49,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:49,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:49,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:49,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580688748] [2025-03-08 09:44:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580688748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:44:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668511706] [2025-03-08 09:44:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:44:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:49,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:44:49,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:44:49,852 INFO L87 Difference]: Start difference. First operand 261 states and 365 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 09:44:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:50,135 INFO L93 Difference]: Finished difference Result 531 states and 747 transitions. [2025-03-08 09:44:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:44:50,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-08 09:44:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:50,137 INFO L225 Difference]: With dead ends: 531 [2025-03-08 09:44:50,137 INFO L226 Difference]: Without dead ends: 265 [2025-03-08 09:44:50,138 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 09:44:50,140 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 104 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:50,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1232 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-08 09:44:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2025-03-08 09:44:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.400763358778626) internal successors, (367), 262 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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 09:44:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 367 transitions. [2025-03-08 09:44:50,147 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 367 transitions. Word has length 127 [2025-03-08 09:44:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:50,147 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 367 transitions. [2025-03-08 09:44:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 09:44:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 367 transitions. [2025-03-08 09:44:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 09:44:50,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:50,149 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:50,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 09:44:50,150 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:50,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:50,151 INFO L85 PathProgramCache]: Analyzing trace with hash 87567002, now seen corresponding path program 1 times [2025-03-08 09:44:50,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:50,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146371855] [2025-03-08 09:44:50,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:50,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:50,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 09:44:50,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 09:44:50,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:50,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146371855] [2025-03-08 09:44:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146371855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:50,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:50,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:44:50,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604989413] [2025-03-08 09:44:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:50,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:44:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:50,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:44:50,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:44:50,589 INFO L87 Difference]: Start difference. First operand 263 states and 367 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 09:44:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:50,764 INFO L93 Difference]: Finished difference Result 406 states and 568 transitions. [2025-03-08 09:44:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-08 09:44:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:50,765 INFO L225 Difference]: With dead ends: 406 [2025-03-08 09:44:50,765 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 09:44:50,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 09:44:50,767 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 451 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:50,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 295 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 09:44:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-08 09:44:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.3969465648854962) internal successors, (366), 262 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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 09:44:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 366 transitions. [2025-03-08 09:44:50,772 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 366 transitions. Word has length 128 [2025-03-08 09:44:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:50,772 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 366 transitions. [2025-03-08 09:44:50,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 09:44:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 366 transitions. [2025-03-08 09:44:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 09:44:50,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:50,773 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:50,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 09:44:50,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:50,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash -941523859, now seen corresponding path program 1 times [2025-03-08 09:44:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824906092] [2025-03-08 09:44:50,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:50,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 09:44:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 09:44:50,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:50,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:51,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824906092] [2025-03-08 09:44:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824906092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:51,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:51,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:44:51,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225721256] [2025-03-08 09:44:51,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:51,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:44:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:51,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:44:51,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:44:51,184 INFO L87 Difference]: Start difference. First operand 263 states and 366 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 09:44:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:51,347 INFO L93 Difference]: Finished difference Result 406 states and 566 transitions. [2025-03-08 09:44:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:44:51,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-08 09:44:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:51,349 INFO L225 Difference]: With dead ends: 406 [2025-03-08 09:44:51,349 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 09:44:51,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:44:51,349 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 189 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:51,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 295 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:44:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 09:44:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-08 09:44:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.3931297709923665) internal successors, (365), 262 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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 09:44:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 365 transitions. [2025-03-08 09:44:51,354 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 365 transitions. Word has length 129 [2025-03-08 09:44:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:51,354 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 365 transitions. [2025-03-08 09:44:51,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states 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 09:44:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 365 transitions. [2025-03-08 09:44:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 09:44:51,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:51,355 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:51,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 09:44:51,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:51,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash -166656280, now seen corresponding path program 1 times [2025-03-08 09:44:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:51,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429680305] [2025-03-08 09:44:51,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:51,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:51,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 09:44:51,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 09:44:51,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:51,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:51,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:51,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429680305] [2025-03-08 09:44:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429680305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:51,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:51,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:51,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586687884] [2025-03-08 09:44:51,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:51,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:51,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:51,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:51,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:51,809 INFO L87 Difference]: Start difference. First operand 263 states and 365 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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 09:44:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:52,182 INFO L93 Difference]: Finished difference Result 438 states and 611 transitions. [2025-03-08 09:44:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:52,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-08 09:44:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:52,184 INFO L225 Difference]: With dead ends: 438 [2025-03-08 09:44:52,184 INFO L226 Difference]: Without dead ends: 295 [2025-03-08 09:44:52,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:44:52,184 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 359 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:52,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 709 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:44:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-08 09:44:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2025-03-08 09:44:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4) internal successors, (406), 290 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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 09:44:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2025-03-08 09:44:52,191 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 130 [2025-03-08 09:44:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:52,191 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2025-03-08 09:44:52,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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 09:44:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2025-03-08 09:44:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 09:44:52,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:52,192 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 09:44:52,193 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:52,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1859013660, now seen corresponding path program 1 times [2025-03-08 09:44:52,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:52,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168678344] [2025-03-08 09:44:52,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:52,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:44:52,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:44:52,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:52,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 09:44:52,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168678344] [2025-03-08 09:44:52,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168678344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:52,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:44:52,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:44:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144273450] [2025-03-08 09:44:52,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:52,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:44:52,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:52,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:44:52,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:44:52,689 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 09:44:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:52,903 INFO L93 Difference]: Finished difference Result 509 states and 707 transitions. [2025-03-08 09:44:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:44:52,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 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 131 [2025-03-08 09:44:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:52,905 INFO L225 Difference]: With dead ends: 509 [2025-03-08 09:44:52,905 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 09:44:52,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:44:52,906 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 384 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:52,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1022 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:44:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 09:44:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-08 09:44:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.3993055555555556) internal successors, (403), 288 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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 09:44:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2025-03-08 09:44:52,911 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 131 [2025-03-08 09:44:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:52,911 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2025-03-08 09:44:52,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 09:44:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2025-03-08 09:44:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 09:44:52,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:52,912 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:52,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 09:44:52,913 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 511544508, now seen corresponding path program 1 times [2025-03-08 09:44:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:52,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146729663] [2025-03-08 09:44:52,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:52,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:52,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:44:53,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:44:53,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:53,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146729663] [2025-03-08 09:44:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146729663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:44:53,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324606063] [2025-03-08 09:44:53,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:53,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:44:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:53,495 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 09:44:53,497 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 09:44:53,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 09:44:53,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 09:44:53,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:53,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:53,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-08 09:44:53,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:44:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:55,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:44:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324606063] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 09:44:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:44:56,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [7, 21] total 44 [2025-03-08 09:44:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170769192] [2025-03-08 09:44:56,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:56,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 09:44:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:56,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 09:44:56,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1724, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 09:44:56,501 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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 09:44:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:44:58,470 INFO L93 Difference]: Finished difference Result 776 states and 1082 transitions. [2025-03-08 09:44:58,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 09:44:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-08 09:44:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:44:58,472 INFO L225 Difference]: With dead ends: 776 [2025-03-08 09:44:58,472 INFO L226 Difference]: Without dead ends: 633 [2025-03-08 09:44:58,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=310, Invalid=2882, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 09:44:58,475 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 862 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:44:58,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 2955 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 09:44:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-08 09:44:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 530. [2025-03-08 09:44:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.4083175803402646) internal successors, (745), 529 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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 09:44:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 745 transitions. [2025-03-08 09:44:58,485 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 745 transitions. Word has length 131 [2025-03-08 09:44:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:44:58,485 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 745 transitions. [2025-03-08 09:44:58,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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 09:44:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 745 transitions. [2025-03-08 09:44:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 09:44:58,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:44:58,487 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:44:58,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:44:58,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 09:44:58,691 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:44:58,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:44:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1312990463, now seen corresponding path program 1 times [2025-03-08 09:44:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:44:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433723646] [2025-03-08 09:44:58,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:44:58,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 09:44:58,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 09:44:58,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:58,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:44:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433723646] [2025-03-08 09:44:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433723646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:44:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003422713] [2025-03-08 09:44:59,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:44:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:44:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:44:59,451 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 09:44:59,453 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 09:44:59,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 09:44:59,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 09:44:59,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:44:59,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:44:59,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 09:44:59,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:44:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:44:59,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:44:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003422713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:44:59,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:44:59,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-03-08 09:44:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791523517] [2025-03-08 09:44:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:44:59,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:44:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:44:59,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:44:59,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:44:59,942 INFO L87 Difference]: Start difference. First operand 530 states and 745 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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 09:45:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:00,272 INFO L93 Difference]: Finished difference Result 1045 states and 1471 transitions. [2025-03-08 09:45:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:45:00,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-08 09:45:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:00,275 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 09:45:00,275 INFO L226 Difference]: Without dead ends: 588 [2025-03-08 09:45:00,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2025-03-08 09:45:00,277 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 242 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:00,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1521 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:45:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-08 09:45:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 573. [2025-03-08 09:45:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4038461538461537) internal successors, (803), 572 states have internal predecessors, (803), 0 states have call successors, (0), 0 states 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 09:45:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 803 transitions. [2025-03-08 09:45:00,288 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 803 transitions. Word has length 132 [2025-03-08 09:45:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:00,289 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 803 transitions. [2025-03-08 09:45:00,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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 09:45:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 803 transitions. [2025-03-08 09:45:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 09:45:00,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:00,291 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:45:00,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 09:45:00,495 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,SelfDestructingSolverStorable21 [2025-03-08 09:45:00,495 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:00,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash -75172380, now seen corresponding path program 1 times [2025-03-08 09:45:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149964546] [2025-03-08 09:45:00,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:00,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 09:45:00,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 09:45:00,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:00,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149964546] [2025-03-08 09:45:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149964546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:45:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068633979] [2025-03-08 09:45:01,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:01,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:01,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:01,167 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 09:45:01,169 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 09:45:01,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 09:45:01,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 09:45:01,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:01,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:01,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-08 09:45:01,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:02,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:45:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068633979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:45:03,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:45:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 19] total 43 [2025-03-08 09:45:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847309840] [2025-03-08 09:45:03,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:45:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 09:45:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:03,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 09:45:03,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1654, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 09:45:03,747 INFO L87 Difference]: Start difference. First operand 573 states and 803 transitions. Second operand has 43 states, 43 states have (on average 8.953488372093023) internal successors, (385), 43 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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 09:45:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:06,460 INFO L93 Difference]: Finished difference Result 1693 states and 2384 transitions. [2025-03-08 09:45:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-08 09:45:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 8.953488372093023) internal successors, (385), 43 states have internal predecessors, (385), 0 states have call successors, (0), 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 132 [2025-03-08 09:45:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:06,464 INFO L225 Difference]: With dead ends: 1693 [2025-03-08 09:45:06,464 INFO L226 Difference]: Without dead ends: 1290 [2025-03-08 09:45:06,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=837, Invalid=7173, Unknown=0, NotChecked=0, Total=8010 [2025-03-08 09:45:06,466 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1397 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 3589 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:06,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 3485 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3589 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 09:45:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-08 09:45:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 940. [2025-03-08 09:45:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 939 states have (on average 1.4195953141640043) internal successors, (1333), 939 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states 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 09:45:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1333 transitions. [2025-03-08 09:45:06,481 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1333 transitions. Word has length 132 [2025-03-08 09:45:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1333 transitions. [2025-03-08 09:45:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.953488372093023) internal successors, (385), 43 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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 09:45:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1333 transitions. [2025-03-08 09:45:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 09:45:06,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:06,483 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:45:06,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 09:45:06,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:06,687 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1680207043, now seen corresponding path program 1 times [2025-03-08 09:45:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068111634] [2025-03-08 09:45:06,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:06,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 09:45:06,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 09:45:06,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:06,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068111634] [2025-03-08 09:45:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068111634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:45:06,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:45:06,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:45:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526717723] [2025-03-08 09:45:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:45:06,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:45:06,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:06,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:45:06,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:45:06,990 INFO L87 Difference]: Start difference. First operand 940 states and 1333 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:45:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:07,243 INFO L93 Difference]: Finished difference Result 1801 states and 2564 transitions. [2025-03-08 09:45:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:45:07,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-08 09:45:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:07,246 INFO L225 Difference]: With dead ends: 1801 [2025-03-08 09:45:07,246 INFO L226 Difference]: Without dead ends: 996 [2025-03-08 09:45:07,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:45:07,247 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 200 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:07,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 732 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:45:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-08 09:45:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 990. [2025-03-08 09:45:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4054600606673406) internal successors, (1390), 989 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states 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 09:45:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1390 transitions. [2025-03-08 09:45:07,262 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1390 transitions. Word has length 133 [2025-03-08 09:45:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:07,262 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1390 transitions. [2025-03-08 09:45:07,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:45:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1390 transitions. [2025-03-08 09:45:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 09:45:07,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:07,264 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 09:45:07,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 09:45:07,264 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:07,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash 918865888, now seen corresponding path program 1 times [2025-03-08 09:45:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:07,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857804692] [2025-03-08 09:45:07,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:07,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 09:45:07,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 09:45:07,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:07,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:07,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857804692] [2025-03-08 09:45:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857804692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:45:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84167845] [2025-03-08 09:45:07,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:07,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:07,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:07,719 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 09:45:07,721 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 09:45:07,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 09:45:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 09:45:08,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:08,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:08,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 09:45:08,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:08,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:45:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84167845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:45:08,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:45:08,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2025-03-08 09:45:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320590958] [2025-03-08 09:45:08,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:45:08,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:45:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:08,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:45:08,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:45:08,362 INFO L87 Difference]: Start difference. First operand 990 states and 1390 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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 09:45:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:08,812 INFO L93 Difference]: Finished difference Result 1754 states and 2465 transitions. [2025-03-08 09:45:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 09:45:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-08 09:45:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:08,819 INFO L225 Difference]: With dead ends: 1754 [2025-03-08 09:45:08,819 INFO L226 Difference]: Without dead ends: 1007 [2025-03-08 09:45:08,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-03-08 09:45:08,820 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 415 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:08,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1077 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:45:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-03-08 09:45:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 995. [2025-03-08 09:45:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.403420523138833) internal successors, (1395), 994 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states 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 09:45:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1395 transitions. [2025-03-08 09:45:08,839 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1395 transitions. Word has length 134 [2025-03-08 09:45:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:08,839 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1395 transitions. [2025-03-08 09:45:08,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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 09:45:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1395 transitions. [2025-03-08 09:45:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 09:45:08,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:08,858 INFO L218 NwaCegarLoop]: trace histogram [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 09:45:08,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 09:45:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:09,059 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1141149069, now seen corresponding path program 1 times [2025-03-08 09:45:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133132619] [2025-03-08 09:45:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:09,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 09:45:09,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 09:45:09,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:09,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:09,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133132619] [2025-03-08 09:45:09,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133132619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:45:09,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:45:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:45:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933330554] [2025-03-08 09:45:09,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:45:09,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:45:09,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:09,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:45:09,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:45:09,246 INFO L87 Difference]: Start difference. First operand 995 states and 1395 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:45:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:09,346 INFO L93 Difference]: Finished difference Result 1830 states and 2565 transitions. [2025-03-08 09:45:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:45:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-08 09:45:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:09,349 INFO L225 Difference]: With dead ends: 1830 [2025-03-08 09:45:09,349 INFO L226 Difference]: Without dead ends: 996 [2025-03-08 09:45:09,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:45:09,351 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 24 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:09,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 848 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:45:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-08 09:45:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 959. [2025-03-08 09:45:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 1.4018789144050103) internal successors, (1343), 958 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states 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 09:45:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1343 transitions. [2025-03-08 09:45:09,366 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1343 transitions. Word has length 135 [2025-03-08 09:45:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1343 transitions. [2025-03-08 09:45:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:45:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1343 transitions. [2025-03-08 09:45:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 09:45:09,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:09,367 INFO L218 NwaCegarLoop]: trace histogram [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 09:45:09,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 09:45:09,368 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash -49785932, now seen corresponding path program 1 times [2025-03-08 09:45:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:09,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165031618] [2025-03-08 09:45:09,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:09,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:09,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 09:45:09,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 09:45:09,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:09,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165031618] [2025-03-08 09:45:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165031618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:45:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108235709] [2025-03-08 09:45:10,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:10,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:10,170 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 09:45:10,171 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 09:45:10,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 09:45:10,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 09:45:10,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:10,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:10,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-08 09:45:10,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:11,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:45:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:12,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108235709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:45:12,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:45:12,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 43 [2025-03-08 09:45:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540233535] [2025-03-08 09:45:12,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:45:12,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 09:45:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:12,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 09:45:12,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1660, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 09:45:12,477 INFO L87 Difference]: Start difference. First operand 959 states and 1343 transitions. Second operand has 43 states, 43 states have (on average 9.0) internal successors, (387), 43 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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 09:45:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:15,706 INFO L93 Difference]: Finished difference Result 1821 states and 2525 transitions. [2025-03-08 09:45:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-08 09:45:15,706 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 9.0) internal successors, (387), 43 states have internal predecessors, (387), 0 states have call successors, (0), 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 135 [2025-03-08 09:45:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:15,709 INFO L225 Difference]: With dead ends: 1821 [2025-03-08 09:45:15,709 INFO L226 Difference]: Without dead ends: 1166 [2025-03-08 09:45:15,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2202 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1163, Invalid=9139, Unknown=0, NotChecked=0, Total=10302 [2025-03-08 09:45:15,713 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1493 mSDsluCounter, 4002 mSDsCounter, 0 mSdLazyCounter, 4756 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 4788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:15,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 4126 Invalid, 4788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4756 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 09:45:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-03-08 09:45:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 852. [2025-03-08 09:45:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.3842538190364277) internal successors, (1178), 851 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states 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 09:45:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1178 transitions. [2025-03-08 09:45:15,726 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1178 transitions. Word has length 135 [2025-03-08 09:45:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:15,726 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1178 transitions. [2025-03-08 09:45:15,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.0) internal successors, (387), 43 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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 09:45:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1178 transitions. [2025-03-08 09:45:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 09:45:15,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:15,728 INFO L218 NwaCegarLoop]: trace histogram [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 09:45:15,739 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 09:45:15,928 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,SelfDestructingSolverStorable26 [2025-03-08 09:45:15,929 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:15,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -413759555, now seen corresponding path program 1 times [2025-03-08 09:45:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:15,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136839530] [2025-03-08 09:45:15,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 09:45:16,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 09:45:16,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:16,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136839530] [2025-03-08 09:45:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136839530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:45:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094834492] [2025-03-08 09:45:16,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:16,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:16,437 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 09:45:16,439 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 09:45:16,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 09:45:16,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 09:45:16,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:16,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 09:45:16,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:16,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:45:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:17,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094834492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:45:17,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:45:17,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2025-03-08 09:45:17,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688225942] [2025-03-08 09:45:17,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:45:17,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 09:45:17,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:17,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 09:45:17,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:45:17,463 INFO L87 Difference]: Start difference. First operand 852 states and 1178 transitions. Second operand has 24 states, 24 states have (on average 15.125) internal successors, (363), 24 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 09:45:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:18,223 INFO L93 Difference]: Finished difference Result 1355 states and 1875 transitions. [2025-03-08 09:45:18,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 09:45:18,223 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 15.125) internal successors, (363), 24 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) Word has length 137 [2025-03-08 09:45:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:18,225 INFO L225 Difference]: With dead ends: 1355 [2025-03-08 09:45:18,226 INFO L226 Difference]: Without dead ends: 914 [2025-03-08 09:45:18,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=302, Invalid=1954, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 09:45:18,227 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 1283 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:18,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 3633 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:45:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-08 09:45:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 871. [2025-03-08 09:45:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.3827586206896552) internal successors, (1203), 870 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states 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 09:45:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1203 transitions. [2025-03-08 09:45:18,240 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1203 transitions. Word has length 137 [2025-03-08 09:45:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1203 transitions. [2025-03-08 09:45:18,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 15.125) internal successors, (363), 24 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 09:45:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1203 transitions. [2025-03-08 09:45:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 09:45:18,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:18,243 INFO L218 NwaCegarLoop]: trace histogram [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 09:45:18,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 09:45:18,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 09:45:18,444 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:18,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1946069943, now seen corresponding path program 1 times [2025-03-08 09:45:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752400502] [2025-03-08 09:45:18,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:18,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 09:45:18,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 09:45:18,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:18,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752400502] [2025-03-08 09:45:18,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752400502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:45:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160046706] [2025-03-08 09:45:18,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:18,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:18,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:18,765 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 09:45:18,766 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 09:45:19,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 09:45:19,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 09:45:19,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:19,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 09:45:19,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:19,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:45:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:45:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160046706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:45:19,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:45:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 09:45:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082162603] [2025-03-08 09:45:19,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:45:19,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:45:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:19,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:45:19,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:45:19,322 INFO L87 Difference]: Start difference. First operand 871 states and 1203 transitions. Second operand has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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 09:45:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:19,433 INFO L93 Difference]: Finished difference Result 1079 states and 1492 transitions. [2025-03-08 09:45:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:45:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 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 139 [2025-03-08 09:45:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:19,434 INFO L225 Difference]: With dead ends: 1079 [2025-03-08 09:45:19,434 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 09:45:19,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 272 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:45:19,435 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 586 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:45:19,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1071 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:45:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 09:45:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 09:45:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states 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 09:45:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 09:45:19,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2025-03-08 09:45:19,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:19,435 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 09:45:19,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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 09:45:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 09:45:19,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 09:45:19,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:45:19,447 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 09:45:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:19,641 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-08 09:45:19,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 09:45:19,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:45:19,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:45:19 BoogieIcfgContainer [2025-03-08 09:45:19,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:45:19,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:45:19,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:45:19,724 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:45:19,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:44:43" (3/4) ... [2025-03-08 09:45:19,726 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 09:45:19,743 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 09:45:19,744 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 09:45:19,745 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 09:45:19,745 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 09:45:19,746 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 09:45:19,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 09:45:19,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 09:45:19,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:45:19,846 INFO L158 Benchmark]: Toolchain (without parser) took 38112.44ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 129.2MB in the beginning and 162.2MB in the end (delta: -33.0MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. [2025-03-08 09:45:19,846 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:19,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.00ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 107.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:45:19,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.57ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 92.2MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:45:19,847 INFO L158 Benchmark]: Boogie Preprocessor took 120.09ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 83.2MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:45:19,847 INFO L158 Benchmark]: IcfgBuilder took 901.33ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 61.2MB in the end (delta: 22.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2025-03-08 09:45:19,848 INFO L158 Benchmark]: TraceAbstraction took 36540.45ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 61.2MB in the beginning and 174.4MB in the end (delta: -113.1MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2025-03-08 09:45:19,848 INFO L158 Benchmark]: Witness Printer took 121.21ms. Allocated memory is still 360.7MB. Free memory was 174.4MB in the beginning and 162.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:45:19,849 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.00ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 107.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.57ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 92.2MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.09ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 83.2MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 901.33ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 61.2MB in the end (delta: 22.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 36540.45ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 61.2MB in the beginning and 174.4MB in the end (delta: -113.1MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. * Witness Printer took 121.21ms. Allocated memory is still 360.7MB. Free memory was 174.4MB in the beginning and 162.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 269 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.4s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10010 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10010 mSDsluCounter, 34014 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28081 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19046 IncrementalHoareTripleChecker+Invalid, 19142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 5933 mSDtfsCounter, 19046 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2005 GetRequests, 1547 SyntacticMatches, 3 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5211 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=995occurred in iteration=25, InterpolantAutomatonStates: 311, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 1126 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 3993 NumberOfCodeBlocks, 3993 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4626 ConstructedInterpolants, 0 QuantifiedInterpolants, 27421 SizeOfPredicates, 39 NumberOfNonLiveVariables, 5788 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 41 InterpolantComputations, 25 PerfectInterpolantSequences, 534/751 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 104]: Location Invariant Derived location invariant: (((((var_5 == 0) && (var_13 == 1)) && (mask_SORT_1 == 0)) || (((((((((((state_18 == 0) && (state_29 == 0)) && (var_5 == 0)) && (state_22 == 0)) && (var_13 == 1)) && (state_33 == 0)) && (state_6 == 0)) && (mask_SORT_1 == 1)) && (state_14 == 1)) && (state_25 == 0)) && (state_9 == 0))) || ((((var_5 == 0) && (((short) state_14 + 1) == 0)) && (var_13 == 1)) && (mask_SORT_1 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-08 09:45:19,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE