./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:50:44,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:50:44,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:50:44,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:50:44,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:50:44,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:50:44,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:50:44,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:50:44,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:50:44,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:50:44,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:50:44,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:50:44,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:50:44,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:50:44,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:50:44,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:50:44,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:50:44,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:50:44,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:50:44,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:50:44,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:50:44,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:50:44,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:50:44,876 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2025-03-16 17:50:45,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:50:45,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:50:45,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:50:45,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:50:45,112 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:50:45,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2025-03-16 17:50:46,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f914f8781/598acde45a7c4ee5bac51c7f89d0a402/FLAGe819e61e0 [2025-03-16 17:50:46,480 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:50:46,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2025-03-16 17:50:46,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f914f8781/598acde45a7c4ee5bac51c7f89d0a402/FLAGe819e61e0 [2025-03-16 17:50:46,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f914f8781/598acde45a7c4ee5bac51c7f89d0a402 [2025-03-16 17:50:46,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:50:46,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:50:46,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:50:46,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:50:46,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:50:46,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:46,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4743d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46, skipping insertion in model container [2025-03-16 17:50:46,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:46,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:50:46,937 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/loop-invgen/heapsort.i[893,906] [2025-03-16 17:50:46,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:50:46,962 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:50:46,969 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/loop-invgen/heapsort.i[893,906] [2025-03-16 17:50:46,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:50:46,989 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:50:46,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46 WrapperNode [2025-03-16 17:50:46,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:50:46,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:50:46,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:50:46,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:50:46,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,019 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2025-03-16 17:50:47,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:50:47,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:50:47,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:50:47,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:50:47,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,041 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 17:50:47,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:50:47,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:50:47,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:50:47,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:50:47,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (1/1) ... [2025-03-16 17:50:47,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:50:47,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:47,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:50:47,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:50:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:50:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:50:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:50:47,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:50:47,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 17:50:47,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 17:50:47,134 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:50:47,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:50:47,268 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 17:50:47,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:50:47,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:50:47,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:50:47,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:47 BoogieIcfgContainer [2025-03-16 17:50:47,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:50:47,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:50:47,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:50:47,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:50:47,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:50:46" (1/3) ... [2025-03-16 17:50:47,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef9ec60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:50:47, skipping insertion in model container [2025-03-16 17:50:47,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:46" (2/3) ... [2025-03-16 17:50:47,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef9ec60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:50:47, skipping insertion in model container [2025-03-16 17:50:47,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:47" (3/3) ... [2025-03-16 17:50:47,290 INFO L128 eAbstractionObserver]: Analyzing ICFG heapsort.i [2025-03-16 17:50:47,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:50:47,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG heapsort.i that has 2 procedures, 37 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 17:50:47,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:50:47,348 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;@29f80f7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:50:47,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:50:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-16 17:50:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:50:47,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:47,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:47,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1938308096, now seen corresponding path program 1 times [2025-03-16 17:50:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137492188] [2025-03-16 17:50:47,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:47,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:50:47,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:50:47,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:47,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137492188] [2025-03-16 17:50:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137492188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922870586] [2025-03-16 17:50:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:47,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:47,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:47,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:47,621 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:47,822 INFO L93 Difference]: Finished difference Result 109 states and 204 transitions. [2025-03-16 17:50:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:50:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-16 17:50:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:47,828 INFO L225 Difference]: With dead ends: 109 [2025-03-16 17:50:47,828 INFO L226 Difference]: Without dead ends: 69 [2025-03-16 17:50:47,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:47,832 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 32 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:47,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 222 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-16 17:50:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2025-03-16 17:50:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 17:50:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 95 transitions. [2025-03-16 17:50:47,871 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 95 transitions. Word has length 10 [2025-03-16 17:50:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:47,871 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 95 transitions. [2025-03-16 17:50:47,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 95 transitions. [2025-03-16 17:50:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:50:47,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:47,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:47,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:50:47,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:47,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1926898143, now seen corresponding path program 1 times [2025-03-16 17:50:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076018599] [2025-03-16 17:50:47,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:47,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:50:47,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:50:47,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:47,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076018599] [2025-03-16 17:50:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076018599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:47,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950751786] [2025-03-16 17:50:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:47,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:47,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:47,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:47,967 INFO L87 Difference]: Start difference. First operand 60 states and 95 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:48,049 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2025-03-16 17:50:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-16 17:50:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:48,051 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:50:48,052 INFO L226 Difference]: Without dead ends: 66 [2025-03-16 17:50:48,052 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-16 17:50:48,053 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:48,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 139 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-16 17:50:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-16 17:50:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 17:50:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2025-03-16 17:50:48,067 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 10 [2025-03-16 17:50:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:48,067 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2025-03-16 17:50:48,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2025-03-16 17:50:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:50:48,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:48,068 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:48,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:50:48,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:48,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:48,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1539221869, now seen corresponding path program 1 times [2025-03-16 17:50:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563596332] [2025-03-16 17:50:48,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:48,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:50:48,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:50:48,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:48,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:48,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:48,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563596332] [2025-03-16 17:50:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563596332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929646655] [2025-03-16 17:50:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:48,144 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:48,296 INFO L93 Difference]: Finished difference Result 101 states and 156 transitions. [2025-03-16 17:50:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:48,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-16 17:50:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:48,298 INFO L225 Difference]: With dead ends: 101 [2025-03-16 17:50:48,298 INFO L226 Difference]: Without dead ends: 99 [2025-03-16 17:50:48,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:48,299 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 25 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:48,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 236 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-16 17:50:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2025-03-16 17:50:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 43 states have internal predecessors, (55), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 17:50:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2025-03-16 17:50:48,312 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 15 [2025-03-16 17:50:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:48,312 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2025-03-16 17:50:48,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2025-03-16 17:50:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:50:48,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:48,313 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:48,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:50:48,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:48,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1385151612, now seen corresponding path program 1 times [2025-03-16 17:50:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327564043] [2025-03-16 17:50:48,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:48,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:50:48,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:50:48,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:48,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:48,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327564043] [2025-03-16 17:50:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327564043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912503290] [2025-03-16 17:50:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:48,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:48,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:48,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:48,396 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:48,523 INFO L93 Difference]: Finished difference Result 125 states and 192 transitions. [2025-03-16 17:50:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-16 17:50:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:48,526 INFO L225 Difference]: With dead ends: 125 [2025-03-16 17:50:48,527 INFO L226 Difference]: Without dead ends: 123 [2025-03-16 17:50:48,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:48,527 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:48,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 185 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-16 17:50:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2025-03-16 17:50:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 55 states have internal predecessors, (67), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-16 17:50:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 167 transitions. [2025-03-16 17:50:48,554 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 167 transitions. Word has length 15 [2025-03-16 17:50:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:48,554 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 167 transitions. [2025-03-16 17:50:48,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 167 transitions. [2025-03-16 17:50:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:50:48,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:48,555 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:50:48,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:48,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash -412585527, now seen corresponding path program 1 times [2025-03-16 17:50:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783978001] [2025-03-16 17:50:48,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:48,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:50:48,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:50:48,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:48,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783978001] [2025-03-16 17:50:48,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783978001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655495898] [2025-03-16 17:50:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:48,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:48,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:48,671 INFO L87 Difference]: Start difference. First operand 108 states and 167 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:48,820 INFO L93 Difference]: Finished difference Result 157 states and 248 transitions. [2025-03-16 17:50:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:50:48,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-16 17:50:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:48,822 INFO L225 Difference]: With dead ends: 157 [2025-03-16 17:50:48,822 INFO L226 Difference]: Without dead ends: 155 [2025-03-16 17:50:48,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:50:48,822 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 57 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:48,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 175 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-16 17:50:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2025-03-16 17:50:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 68 states have (on average 1.338235294117647) internal successors, (91), 75 states have internal predecessors, (91), 76 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (76), 69 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 17:50:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 243 transitions. [2025-03-16 17:50:48,851 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 243 transitions. Word has length 15 [2025-03-16 17:50:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:48,851 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 243 transitions. [2025-03-16 17:50:48,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 243 transitions. [2025-03-16 17:50:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:50:48,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:48,854 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:48,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:50:48,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:48,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash -705988534, now seen corresponding path program 1 times [2025-03-16 17:50:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:48,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955363922] [2025-03-16 17:50:48,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:48,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:48,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:50:48,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:50:48,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:48,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955363922] [2025-03-16 17:50:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955363922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:50:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655401915] [2025-03-16 17:50:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:50:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:48,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:50:48,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:50:48,876 INFO L87 Difference]: Start difference. First operand 152 states and 243 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:48,916 INFO L93 Difference]: Finished difference Result 293 states and 468 transitions. [2025-03-16 17:50:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:50:48,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-16 17:50:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:48,918 INFO L225 Difference]: With dead ends: 293 [2025-03-16 17:50:48,918 INFO L226 Difference]: Without dead ends: 220 [2025-03-16 17:50:48,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:50:48,919 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:48,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 124 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:50:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-16 17:50:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 182. [2025-03-16 17:50:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 80 states have (on average 1.35) internal successors, (108), 88 states have internal predecessors, (108), 94 states have call successors, (94), 7 states have call predecessors, (94), 7 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-16 17:50:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 296 transitions. [2025-03-16 17:50:48,966 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 296 transitions. Word has length 15 [2025-03-16 17:50:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:48,966 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 296 transitions. [2025-03-16 17:50:48,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:50:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 296 transitions. [2025-03-16 17:50:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 17:50:48,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:48,969 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:48,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:50:48,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:48,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1788126744, now seen corresponding path program 1 times [2025-03-16 17:50:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476142550] [2025-03-16 17:50:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:48,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 17:50:48,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:50:48,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:48,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 17:50:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476142550] [2025-03-16 17:50:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476142550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:49,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:49,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891914462] [2025-03-16 17:50:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:49,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:49,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:49,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:49,032 INFO L87 Difference]: Start difference. First operand 182 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:50:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:49,152 INFO L93 Difference]: Finished difference Result 268 states and 441 transitions. [2025-03-16 17:50:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:50:49,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-16 17:50:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:49,154 INFO L225 Difference]: With dead ends: 268 [2025-03-16 17:50:49,154 INFO L226 Difference]: Without dead ends: 266 [2025-03-16 17:50:49,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:49,155 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 42 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:49,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 233 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-16 17:50:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2025-03-16 17:50:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 120 states have internal predecessors, (146), 120 states have call successors, (120), 9 states have call predecessors, (120), 9 states have return successors, (120), 106 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-16 17:50:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2025-03-16 17:50:49,196 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2025-03-16 17:50:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:49,196 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2025-03-16 17:50:49,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:50:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2025-03-16 17:50:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 17:50:49,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:49,197 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:49,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:50:49,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:49,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash -157454365, now seen corresponding path program 1 times [2025-03-16 17:50:49,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127367663] [2025-03-16 17:50:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:49,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 17:50:49,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 17:50:49,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:49,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 17:50:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127367663] [2025-03-16 17:50:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127367663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541360137] [2025-03-16 17:50:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:49,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:49,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:49,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:49,250 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:50:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:49,453 INFO L93 Difference]: Finished difference Result 552 states and 904 transitions. [2025-03-16 17:50:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:50:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-16 17:50:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:49,456 INFO L225 Difference]: With dead ends: 552 [2025-03-16 17:50:49,457 INFO L226 Difference]: Without dead ends: 376 [2025-03-16 17:50:49,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:49,458 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 57 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:49,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 155 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-16 17:50:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 237. [2025-03-16 17:50:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 121 states have internal predecessors, (146), 120 states have call successors, (120), 9 states have call predecessors, (120), 9 states have return successors, (120), 106 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-16 17:50:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 386 transitions. [2025-03-16 17:50:49,515 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 386 transitions. Word has length 24 [2025-03-16 17:50:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 386 transitions. [2025-03-16 17:50:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:50:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 386 transitions. [2025-03-16 17:50:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 17:50:49,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:49,516 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:49,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:50:49,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:49,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1074399739, now seen corresponding path program 1 times [2025-03-16 17:50:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:49,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745196967] [2025-03-16 17:50:49,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:49,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 17:50:49,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:50:49,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:49,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:50:49,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745196967] [2025-03-16 17:50:49,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745196967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:49,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:49,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746816543] [2025-03-16 17:50:49,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:49,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:49,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:49,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:49,596 INFO L87 Difference]: Start difference. First operand 237 states and 386 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:50:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:49,835 INFO L93 Difference]: Finished difference Result 405 states and 683 transitions. [2025-03-16 17:50:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:50:49,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-16 17:50:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:49,838 INFO L225 Difference]: With dead ends: 405 [2025-03-16 17:50:49,838 INFO L226 Difference]: Without dead ends: 403 [2025-03-16 17:50:49,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:50:49,839 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:49,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 260 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-16 17:50:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 359. [2025-03-16 17:50:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 178 states have internal predecessors, (215), 195 states have call successors, (195), 10 states have call predecessors, (195), 10 states have return successors, (195), 170 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-16 17:50:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 605 transitions. [2025-03-16 17:50:49,917 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 605 transitions. Word has length 27 [2025-03-16 17:50:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:49,918 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 605 transitions. [2025-03-16 17:50:49,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:50:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 605 transitions. [2025-03-16 17:50:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 17:50:49,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:49,919 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:49,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 17:50:49,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:49,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1143358214, now seen corresponding path program 1 times [2025-03-16 17:50:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724013496] [2025-03-16 17:50:49,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:49,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 17:50:49,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:50:49,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:49,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:50:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:50,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724013496] [2025-03-16 17:50:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724013496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:50,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:50,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:50,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683424304] [2025-03-16 17:50:50,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:50,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:50,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:50,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:50,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:50,014 INFO L87 Difference]: Start difference. First operand 359 states and 605 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:50:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:50,234 INFO L93 Difference]: Finished difference Result 424 states and 712 transitions. [2025-03-16 17:50:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:50:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-16 17:50:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:50,238 INFO L225 Difference]: With dead ends: 424 [2025-03-16 17:50:50,238 INFO L226 Difference]: Without dead ends: 422 [2025-03-16 17:50:50,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:50:50,238 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 75 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:50,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-16 17:50:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 366. [2025-03-16 17:50:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 156 states have (on average 1.3974358974358974) internal successors, (218), 181 states have internal predecessors, (218), 198 states have call successors, (198), 11 states have call predecessors, (198), 11 states have return successors, (198), 173 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-16 17:50:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 614 transitions. [2025-03-16 17:50:50,301 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 614 transitions. Word has length 27 [2025-03-16 17:50:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:50,301 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 614 transitions. [2025-03-16 17:50:50,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:50:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 614 transitions. [2025-03-16 17:50:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:50:50,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:50,302 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:50,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 17:50:50,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:50,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash -311320113, now seen corresponding path program 1 times [2025-03-16 17:50:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-03-16 17:50:50,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:50,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:50,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:50:50,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:50:50,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:50,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 17:50:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-03-16 17:50:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252862364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:50,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435267939] [2025-03-16 17:50:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:50,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:50,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:50,378 INFO L87 Difference]: Start difference. First operand 366 states and 614 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 17:50:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:50,546 INFO L93 Difference]: Finished difference Result 419 states and 686 transitions. [2025-03-16 17:50:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:50:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-03-16 17:50:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:50,549 INFO L225 Difference]: With dead ends: 419 [2025-03-16 17:50:50,549 INFO L226 Difference]: Without dead ends: 417 [2025-03-16 17:50:50,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:50:50,550 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:50,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 244 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-16 17:50:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 296. [2025-03-16 17:50:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 151 states have internal predecessors, (188), 148 states have call successors, (148), 11 states have call predecessors, (148), 11 states have return successors, (148), 133 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-16 17:50:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 484 transitions. [2025-03-16 17:50:50,598 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 484 transitions. Word has length 37 [2025-03-16 17:50:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:50,598 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 484 transitions. [2025-03-16 17:50:50,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 17:50:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 484 transitions. [2025-03-16 17:50:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:50:50,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:50,599 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:50,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 17:50:50,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1385837877, now seen corresponding path program 1 times [2025-03-16 17:50:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149327272] [2025-03-16 17:50:50,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:50,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:50:50,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:50:50,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:50,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 17:50:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149327272] [2025-03-16 17:50:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149327272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:50,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359431882] [2025-03-16 17:50:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:50,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:50,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:50,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:50,654 INFO L87 Difference]: Start difference. First operand 296 states and 484 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:50:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:50,783 INFO L93 Difference]: Finished difference Result 323 states and 520 transitions. [2025-03-16 17:50:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:50:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2025-03-16 17:50:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:50,786 INFO L225 Difference]: With dead ends: 323 [2025-03-16 17:50:50,786 INFO L226 Difference]: Without dead ends: 321 [2025-03-16 17:50:50,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:50:50,787 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:50,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 151 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-16 17:50:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 300. [2025-03-16 17:50:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 154 states have internal predecessors, (191), 148 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (148), 133 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-16 17:50:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 487 transitions. [2025-03-16 17:50:50,823 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 487 transitions. Word has length 37 [2025-03-16 17:50:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:50,823 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 487 transitions. [2025-03-16 17:50:50,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:50:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 487 transitions. [2025-03-16 17:50:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 17:50:50,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:50,824 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 17:50:50,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:50,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:50,824 INFO L85 PathProgramCache]: Analyzing trace with hash -177829837, now seen corresponding path program 1 times [2025-03-16 17:50:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263464662] [2025-03-16 17:50:50,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:50,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 17:50:50,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 17:50:50,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:50,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-16 17:50:50,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263464662] [2025-03-16 17:50:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263464662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:50,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550214013] [2025-03-16 17:50:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:50,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:50,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:50,900 INFO L87 Difference]: Start difference. First operand 300 states and 487 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 17:50:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:51,033 INFO L93 Difference]: Finished difference Result 352 states and 568 transitions. [2025-03-16 17:50:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:50:51,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2025-03-16 17:50:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:51,036 INFO L225 Difference]: With dead ends: 352 [2025-03-16 17:50:51,036 INFO L226 Difference]: Without dead ends: 350 [2025-03-16 17:50:51,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:50:51,036 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:51,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 196 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-16 17:50:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 304. [2025-03-16 17:50:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 157 states have internal predecessors, (194), 148 states have call successors, (148), 13 states have call predecessors, (148), 13 states have return successors, (148), 133 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-16 17:50:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 490 transitions. [2025-03-16 17:50:51,078 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 490 transitions. Word has length 49 [2025-03-16 17:50:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:51,079 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 490 transitions. [2025-03-16 17:50:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 17:50:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 490 transitions. [2025-03-16 17:50:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 17:50:51,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:51,081 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:51,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 17:50:51,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1680449923, now seen corresponding path program 1 times [2025-03-16 17:50:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:51,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19333411] [2025-03-16 17:50:51,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:51,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 17:50:51,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 17:50:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-16 17:50:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19333411] [2025-03-16 17:50:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19333411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:50:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067670832] [2025-03-16 17:50:51,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:51,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:51,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:51,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:50:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:50:51,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 17:50:51,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 17:50:51,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:51,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:51,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:50:51,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:50:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 17:50:51,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:50:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067670832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:50:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-03-16 17:50:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908786684] [2025-03-16 17:50:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:51,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:51,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:51,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:50:51,305 INFO L87 Difference]: Start difference. First operand 304 states and 490 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 17:50:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:51,482 INFO L93 Difference]: Finished difference Result 662 states and 1070 transitions. [2025-03-16 17:50:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:50:51,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2025-03-16 17:50:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:51,485 INFO L225 Difference]: With dead ends: 662 [2025-03-16 17:50:51,485 INFO L226 Difference]: Without dead ends: 382 [2025-03-16 17:50:51,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:50:51,487 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 39 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:51,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 143 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-16 17:50:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 352. [2025-03-16 17:50:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 160 states have (on average 1.3625) internal successors, (218), 178 states have internal predecessors, (218), 178 states have call successors, (178), 13 states have call predecessors, (178), 13 states have return successors, (178), 160 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-16 17:50:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 574 transitions. [2025-03-16 17:50:51,574 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 574 transitions. Word has length 57 [2025-03-16 17:50:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:51,574 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 574 transitions. [2025-03-16 17:50:51,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 17:50:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 574 transitions. [2025-03-16 17:50:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 17:50:51,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:51,579 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2025-03-16 17:50:51,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:50:51,779 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,SelfDestructingSolverStorable13 [2025-03-16 17:50:51,780 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1136718350, now seen corresponding path program 1 times [2025-03-16 17:50:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281015718] [2025-03-16 17:50:51,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:51,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 17:50:51,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 17:50:51,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:51,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 17:50:51,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:51,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281015718] [2025-03-16 17:50:51,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281015718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:50:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688313561] [2025-03-16 17:50:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:51,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:51,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:51,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:50:51,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:50:51,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 17:50:51,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 17:50:51,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:51,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 17:50:51,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:50:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 17:50:52,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:50:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688313561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:52,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:50:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-16 17:50:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901143186] [2025-03-16 17:50:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:52,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:52,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:52,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-16 17:50:52,157 INFO L87 Difference]: Start difference. First operand 352 states and 574 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 17:50:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:52,457 INFO L93 Difference]: Finished difference Result 629 states and 1000 transitions. [2025-03-16 17:50:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:50:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2025-03-16 17:50:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:52,460 INFO L225 Difference]: With dead ends: 629 [2025-03-16 17:50:52,460 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 17:50:52,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 17:50:52,464 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 44 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:52,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 227 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:50:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 17:50:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2025-03-16 17:50:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 123 states have internal predecessors, (150), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 94 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 17:50:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2025-03-16 17:50:52,506 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 79 [2025-03-16 17:50:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:52,506 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2025-03-16 17:50:52,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 17:50:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2025-03-16 17:50:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 17:50:52,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:52,507 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2025-03-16 17:50:52,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:50:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 17:50:52,708 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:52,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:52,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1905888365, now seen corresponding path program 1 times [2025-03-16 17:50:52,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296339973] [2025-03-16 17:50:52,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:52,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 17:50:52,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 17:50:52,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:52,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 17:50:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296339973] [2025-03-16 17:50:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296339973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:50:52,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736804475] [2025-03-16 17:50:52,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:52,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:52,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:50:52,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:50:52,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 17:50:52,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 17:50:52,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:52,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:52,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:50:52,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:50:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-16 17:50:52,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:50:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736804475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:52,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:50:52,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-16 17:50:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980789218] [2025-03-16 17:50:52,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:52,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:52,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:52,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:50:52,982 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 17:50:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:53,115 INFO L93 Difference]: Finished difference Result 431 states and 657 transitions. [2025-03-16 17:50:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:50:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-16 17:50:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:53,116 INFO L225 Difference]: With dead ends: 431 [2025-03-16 17:50:53,116 INFO L226 Difference]: Without dead ends: 191 [2025-03-16 17:50:53,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-16 17:50:53,117 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:53,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 148 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-16 17:50:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2025-03-16 17:50:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 99 states have internal predecessors, (117), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 69 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-16 17:50:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 269 transitions. [2025-03-16 17:50:53,140 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 269 transitions. Word has length 79 [2025-03-16 17:50:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:53,140 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 269 transitions. [2025-03-16 17:50:53,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 17:50:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 269 transitions. [2025-03-16 17:50:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 17:50:53,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:53,141 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:53,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:50:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:53,341 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:53,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1425356632, now seen corresponding path program 1 times [2025-03-16 17:50:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529272176] [2025-03-16 17:50:53,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:53,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 17:50:53,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 17:50:53,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:53,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-16 17:50:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:53,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529272176] [2025-03-16 17:50:53,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529272176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:50:53,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204130290] [2025-03-16 17:50:53,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:53,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:53,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:53,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:50:53,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:50:53,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 17:50:53,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 17:50:53,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:53,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:53,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:50:53,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:50:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-16 17:50:53,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:50:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 17:50:53,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204130290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:50:53,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:50:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-03-16 17:50:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854954045] [2025-03-16 17:50:53,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:50:53,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 17:50:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:53,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 17:50:53,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:50:53,623 INFO L87 Difference]: Start difference. First operand 181 states and 269 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-16 17:50:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:54,597 INFO L93 Difference]: Finished difference Result 486 states and 730 transitions. [2025-03-16 17:50:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-16 17:50:54,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 84 [2025-03-16 17:50:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:54,599 INFO L225 Difference]: With dead ends: 486 [2025-03-16 17:50:54,599 INFO L226 Difference]: Without dead ends: 344 [2025-03-16 17:50:54,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1613, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 17:50:54,601 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 196 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:54,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 995 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:50:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-16 17:50:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 226. [2025-03-16 17:50:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 127 states have internal predecessors, (148), 93 states have call successors, (93), 14 states have call predecessors, (93), 14 states have return successors, (93), 84 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-16 17:50:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 334 transitions. [2025-03-16 17:50:54,634 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 334 transitions. Word has length 84 [2025-03-16 17:50:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:54,634 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 334 transitions. [2025-03-16 17:50:54,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2025-03-16 17:50:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 334 transitions. [2025-03-16 17:50:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 17:50:54,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:54,638 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 17:50:54,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:50:54,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 17:50:54,839 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:50:54,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1338110634, now seen corresponding path program 1 times [2025-03-16 17:50:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640292593] [2025-03-16 17:50:54,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:54,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 17:50:54,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 17:50:54,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:54,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 17:50:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640292593] [2025-03-16 17:50:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640292593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:50:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005869698] [2025-03-16 17:50:54,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:54,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:50:54,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:54,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:50:54,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:50:54,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 17:50:54,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 17:50:54,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:54,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:54,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:50:54,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:50:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-16 17:50:55,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:50:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-16 17:50:55,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005869698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:50:55,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:50:55,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-16 17:50:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960336520] [2025-03-16 17:50:55,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:50:55,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 17:50:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:55,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 17:50:55,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-16 17:50:55,343 INFO L87 Difference]: Start difference. First operand 226 states and 334 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 11 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 11 states have call successors, (49) [2025-03-16 17:50:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:57,625 INFO L93 Difference]: Finished difference Result 814 states and 1276 transitions. [2025-03-16 17:50:57,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-16 17:50:57,625 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 11 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 11 states have call successors, (49) Word has length 111 [2025-03-16 17:50:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:57,627 INFO L225 Difference]: With dead ends: 814 [2025-03-16 17:50:57,627 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:50:57,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1788 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=4887, Unknown=0, NotChecked=0, Total=6162 [2025-03-16 17:50:57,630 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 469 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:57,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1265 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 17:50:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:50:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:50:57,631 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-16 17:50:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:50:57,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2025-03-16 17:50:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:57,632 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:50:57,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 11 states have call successors, (51), 3 states have call predecessors, (51), 2 states have return successors, (49), 11 states have call predecessors, (49), 11 states have call successors, (49) [2025-03-16 17:50:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:50:57,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:50:57,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:50:57,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 17:50:57,836 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,SelfDestructingSolverStorable17 [2025-03-16 17:50:57,839 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:57,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.