./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:39:37,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:39:38,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:39:38,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:39:38,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:39:38,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:39:38,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:39:38,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:39:38,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:39:38,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:39:38,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:39:38,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:39:38,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:39:38,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:39:38,040 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:39:38,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:39:38,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:39:38,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:39:38,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:39:38,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:39:38,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:39:38,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:39:38,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:39:38,043 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-jdk21/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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2025-02-05 10:39:38,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:39:38,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:39:38,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:39:38,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:39:38,262 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:39:38,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2025-02-05 10:39:39,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fb47314b/db528bb4e3484a5a817a2b55810d1a41/FLAG1bb1e6fc9 [2025-02-05 10:39:39,585 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:39:39,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2025-02-05 10:39:39,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fb47314b/db528bb4e3484a5a817a2b55810d1a41/FLAG1bb1e6fc9 [2025-02-05 10:39:39,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fb47314b/db528bb4e3484a5a817a2b55810d1a41 [2025-02-05 10:39:39,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:39:39,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:39:39,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:39:39,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:39:39,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:39:39,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65fd3680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39, skipping insertion in model container [2025-02-05 10:39:39,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:39:39,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2025-02-05 10:39:39,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:39:39,775 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:39:39,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2025-02-05 10:39:39,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:39:39,805 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:39:39,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39 WrapperNode [2025-02-05 10:39:39,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:39:39,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:39:39,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:39:39,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:39:39,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,838 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 145 [2025-02-05 10:39:39,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:39:39,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:39:39,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:39:39,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:39:39,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,856 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-02-05 10:39:39,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:39:39,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:39:39,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:39:39,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:39:39,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (1/1) ... [2025-02-05 10:39:39,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:39:39,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:39,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:39:39,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:39:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:39:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:39:39,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:39:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:39:39,956 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:39:39,959 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:39:40,152 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 10:39:40,152 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:39:40,158 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:39:40,159 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:39:40,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:40 BoogieIcfgContainer [2025-02-05 10:39:40,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:39:40,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:39:40,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:39:40,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:39:40,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:39:39" (1/3) ... [2025-02-05 10:39:40,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dbe1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:39:40, skipping insertion in model container [2025-02-05 10:39:40,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:39:39" (2/3) ... [2025-02-05 10:39:40,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dbe1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:39:40, skipping insertion in model container [2025-02-05 10:39:40,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:40" (3/3) ... [2025-02-05 10:39:40,165 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2025-02-05 10:39:40,174 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:39:40,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_10.c that has 1 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:39:40,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:39:40,213 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;@6ec2c78b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:39:40,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:39:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.868421052631579) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:39:40,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash 111351025, now seen corresponding path program 1 times [2025-02-05 10:39:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832332911] [2025-02-05 10:39:40,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:39:40,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:39:40,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832332911] [2025-02-05 10:39:40,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832332911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147340062] [2025-02-05 10:39:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,367 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.868421052631579) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,391 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2025-02-05 10:39:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:39:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,397 INFO L225 Difference]: With dead ends: 81 [2025-02-05 10:39:40,398 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 10:39:40,399 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-02-05 10:39:40,401 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 10:39:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2025-02-05 10:39:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2025-02-05 10:39:40,422 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 17 [2025-02-05 10:39:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:40,422 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. [2025-02-05 10:39:40,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2025-02-05 10:39:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:39:40,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:39:40,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -182051982, now seen corresponding path program 1 times [2025-02-05 10:39:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492309763] [2025-02-05 10:39:40,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:39:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:39:40,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492309763] [2025-02-05 10:39:40,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492309763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313614647] [2025-02-05 10:39:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,470 INFO L87 Difference]: Start difference. First operand 47 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,487 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2025-02-05 10:39:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:39:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,488 INFO L225 Difference]: With dead ends: 114 [2025-02-05 10:39:40,488 INFO L226 Difference]: Without dead ends: 69 [2025-02-05 10:39:40,488 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-02-05 10:39:40,489 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 143 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-05 10:39:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-02-05 10:39:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2025-02-05 10:39:40,501 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 17 [2025-02-05 10:39:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:40,501 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2025-02-05 10:39:40,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2025-02-05 10:39:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:39:40,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:39:40,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash -843057680, now seen corresponding path program 1 times [2025-02-05 10:39:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061081835] [2025-02-05 10:39:40,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 10:39:40,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:39:40,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061081835] [2025-02-05 10:39:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061081835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621751096] [2025-02-05 10:39:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,564 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,595 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2025-02-05 10:39:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:39:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,596 INFO L225 Difference]: With dead ends: 105 [2025-02-05 10:39:40,597 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 10:39:40,598 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-02-05 10:39:40,598 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 10:39:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-05 10:39:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 124 transitions. [2025-02-05 10:39:40,604 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 124 transitions. Word has length 18 [2025-02-05 10:39:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:40,604 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 124 transitions. [2025-02-05 10:39:40,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2025-02-05 10:39:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:39:40,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:39:40,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1348616305, now seen corresponding path program 1 times [2025-02-05 10:39:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565782396] [2025-02-05 10:39:40,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 10:39:40,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:39:40,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565782396] [2025-02-05 10:39:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565782396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890272879] [2025-02-05 10:39:40,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,649 INFO L87 Difference]: Start difference. First operand 70 states and 124 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,665 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2025-02-05 10:39:40,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:39:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,666 INFO L225 Difference]: With dead ends: 133 [2025-02-05 10:39:40,666 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 10:39:40,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,667 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 10:39:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2025-02-05 10:39:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 165 transitions. [2025-02-05 10:39:40,677 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 165 transitions. Word has length 18 [2025-02-05 10:39:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:40,677 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 165 transitions. [2025-02-05 10:39:40,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 165 transitions. [2025-02-05 10:39:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:39:40,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:39:40,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1642019312, now seen corresponding path program 1 times [2025-02-05 10:39:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030905660] [2025-02-05 10:39:40,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 10:39:40,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:39:40,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030905660] [2025-02-05 10:39:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030905660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369913812] [2025-02-05 10:39:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,748 INFO L87 Difference]: Start difference. First operand 93 states and 165 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,768 INFO L93 Difference]: Finished difference Result 221 states and 395 transitions. [2025-02-05 10:39:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:39:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,774 INFO L225 Difference]: With dead ends: 221 [2025-02-05 10:39:40,774 INFO L226 Difference]: Without dead ends: 133 [2025-02-05 10:39:40,775 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-02-05 10:39:40,775 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-05 10:39:40,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2025-02-05 10:39:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 231 transitions. [2025-02-05 10:39:40,788 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 231 transitions. Word has length 18 [2025-02-05 10:39:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:40,789 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 231 transitions. [2025-02-05 10:39:40,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 231 transitions. [2025-02-05 10:39:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:39:40,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:39:40,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595129, now seen corresponding path program 1 times [2025-02-05 10:39:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659945222] [2025-02-05 10:39:40,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:39:40,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:39:40,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659945222] [2025-02-05 10:39:40,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659945222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313296592] [2025-02-05 10:39:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,845 INFO L87 Difference]: Start difference. First operand 131 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,859 INFO L93 Difference]: Finished difference Result 198 states and 346 transitions. [2025-02-05 10:39:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:39:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,860 INFO L225 Difference]: With dead ends: 198 [2025-02-05 10:39:40,860 INFO L226 Difference]: Without dead ends: 135 [2025-02-05 10:39:40,860 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-02-05 10:39:40,861 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-05 10:39:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-02-05 10:39:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 231 transitions. [2025-02-05 10:39:40,873 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 231 transitions. Word has length 19 [2025-02-05 10:39:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:40,873 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 231 transitions. [2025-02-05 10:39:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 231 transitions. [2025-02-05 10:39:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:39:40,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:39:40,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 637036504, now seen corresponding path program 1 times [2025-02-05 10:39:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42863919] [2025-02-05 10:39:40,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:39:40,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:39:40,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42863919] [2025-02-05 10:39:40,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42863919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662554198] [2025-02-05 10:39:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,920 INFO L87 Difference]: Start difference. First operand 133 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,935 INFO L93 Difference]: Finished difference Result 249 states and 437 transitions. [2025-02-05 10:39:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:39:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,937 INFO L225 Difference]: With dead ends: 249 [2025-02-05 10:39:40,937 INFO L226 Difference]: Without dead ends: 247 [2025-02-05 10:39:40,937 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-02-05 10:39:40,938 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 42 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-05 10:39:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 181. [2025-02-05 10:39:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.7277777777777779) internal successors, (311), 180 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 311 transitions. [2025-02-05 10:39:40,944 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 311 transitions. Word has length 19 [2025-02-05 10:39:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 311 transitions. [2025-02-05 10:39:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 311 transitions. [2025-02-05 10:39:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:39:40,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:40,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:40,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:39:40,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:40,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash 343633497, now seen corresponding path program 1 times [2025-02-05 10:39:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167822526] [2025-02-05 10:39:40,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:40,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:39:40,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:39:40,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:40,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:40,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167822526] [2025-02-05 10:39:40,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167822526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:40,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:40,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086046346] [2025-02-05 10:39:40,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:40,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:40,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:40,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:40,979 INFO L87 Difference]: Start difference. First operand 181 states and 311 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:40,995 INFO L93 Difference]: Finished difference Result 429 states and 741 transitions. [2025-02-05 10:39:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:39:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:40,997 INFO L225 Difference]: With dead ends: 429 [2025-02-05 10:39:40,997 INFO L226 Difference]: Without dead ends: 255 [2025-02-05 10:39:40,997 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-02-05 10:39:40,998 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:40,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-05 10:39:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2025-02-05 10:39:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 431 transitions. [2025-02-05 10:39:41,012 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 431 transitions. Word has length 19 [2025-02-05 10:39:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,012 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 431 transitions. [2025-02-05 10:39:41,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 431 transitions. [2025-02-05 10:39:41,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:39:41,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:39:41,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1726677449, now seen corresponding path program 1 times [2025-02-05 10:39:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013804617] [2025-02-05 10:39:41,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:39:41,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:39:41,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013804617] [2025-02-05 10:39:41,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013804617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834832357] [2025-02-05 10:39:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,042 INFO L87 Difference]: Start difference. First operand 253 states and 431 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,052 INFO L93 Difference]: Finished difference Result 381 states and 645 transitions. [2025-02-05 10:39:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 10:39:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,053 INFO L225 Difference]: With dead ends: 381 [2025-02-05 10:39:41,053 INFO L226 Difference]: Without dead ends: 259 [2025-02-05 10:39:41,054 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-02-05 10:39:41,054 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-05 10:39:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2025-02-05 10:39:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2025-02-05 10:39:41,065 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 20 [2025-02-05 10:39:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,065 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2025-02-05 10:39:41,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2025-02-05 10:39:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:39:41,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:39:41,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2062731222, now seen corresponding path program 1 times [2025-02-05 10:39:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139207964] [2025-02-05 10:39:41,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:39:41,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:39:41,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139207964] [2025-02-05 10:39:41,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139207964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844300416] [2025-02-05 10:39:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,084 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,099 INFO L93 Difference]: Finished difference Result 473 states and 805 transitions. [2025-02-05 10:39:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 10:39:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,101 INFO L225 Difference]: With dead ends: 473 [2025-02-05 10:39:41,101 INFO L226 Difference]: Without dead ends: 471 [2025-02-05 10:39:41,101 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-02-05 10:39:41,102 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-05 10:39:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 357. [2025-02-05 10:39:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.648876404494382) internal successors, (587), 356 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 587 transitions. [2025-02-05 10:39:41,114 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 587 transitions. Word has length 20 [2025-02-05 10:39:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,114 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 587 transitions. [2025-02-05 10:39:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 587 transitions. [2025-02-05 10:39:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:39:41,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:39:41,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1769328215, now seen corresponding path program 1 times [2025-02-05 10:39:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885386615] [2025-02-05 10:39:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:39:41,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:39:41,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885386615] [2025-02-05 10:39:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885386615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359083262] [2025-02-05 10:39:41,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,145 INFO L87 Difference]: Start difference. First operand 357 states and 587 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,162 INFO L93 Difference]: Finished difference Result 841 states and 1389 transitions. [2025-02-05 10:39:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 10:39:41,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,164 INFO L225 Difference]: With dead ends: 841 [2025-02-05 10:39:41,164 INFO L226 Difference]: Without dead ends: 495 [2025-02-05 10:39:41,165 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-02-05 10:39:41,165 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-02-05 10:39:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2025-02-05 10:39:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.6321138211382114) internal successors, (803), 492 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 803 transitions. [2025-02-05 10:39:41,176 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 803 transitions. Word has length 20 [2025-02-05 10:39:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,176 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 803 transitions. [2025-02-05 10:39:41,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 803 transitions. [2025-02-05 10:39:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:39:41,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:39:41,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash -479814368, now seen corresponding path program 1 times [2025-02-05 10:39:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563049369] [2025-02-05 10:39:41,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:39:41,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:39:41,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563049369] [2025-02-05 10:39:41,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563049369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143662766] [2025-02-05 10:39:41,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,214 INFO L87 Difference]: Start difference. First operand 493 states and 803 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,230 INFO L93 Difference]: Finished difference Result 741 states and 1201 transitions. [2025-02-05 10:39:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:39:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,232 INFO L225 Difference]: With dead ends: 741 [2025-02-05 10:39:41,232 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 10:39:41,232 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-02-05 10:39:41,232 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 10:39:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2025-02-05 10:39:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.606) internal successors, (803), 500 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 803 transitions. [2025-02-05 10:39:41,245 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 803 transitions. Word has length 21 [2025-02-05 10:39:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,246 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 803 transitions. [2025-02-05 10:39:41,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 803 transitions. [2025-02-05 10:39:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:39:41,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:39:41,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -985372993, now seen corresponding path program 1 times [2025-02-05 10:39:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206365012] [2025-02-05 10:39:41,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:39:41,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:39:41,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206365012] [2025-02-05 10:39:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206365012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777244127] [2025-02-05 10:39:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,268 INFO L87 Difference]: Start difference. First operand 501 states and 803 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,287 INFO L93 Difference]: Finished difference Result 905 states and 1477 transitions. [2025-02-05 10:39:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:39:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,291 INFO L225 Difference]: With dead ends: 905 [2025-02-05 10:39:41,291 INFO L226 Difference]: Without dead ends: 903 [2025-02-05 10:39:41,292 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-02-05 10:39:41,293 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-02-05 10:39:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 709. [2025-02-05 10:39:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.5635593220338984) internal successors, (1107), 708 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1107 transitions. [2025-02-05 10:39:41,310 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1107 transitions. Word has length 21 [2025-02-05 10:39:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,310 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1107 transitions. [2025-02-05 10:39:41,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1107 transitions. [2025-02-05 10:39:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:39:41,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:39:41,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1278776000, now seen corresponding path program 1 times [2025-02-05 10:39:41,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368835458] [2025-02-05 10:39:41,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:39:41,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:39:41,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368835458] [2025-02-05 10:39:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368835458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133650339] [2025-02-05 10:39:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,335 INFO L87 Difference]: Start difference. First operand 709 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,358 INFO L93 Difference]: Finished difference Result 1657 states and 2597 transitions. [2025-02-05 10:39:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:39:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,361 INFO L225 Difference]: With dead ends: 1657 [2025-02-05 10:39:41,361 INFO L226 Difference]: Without dead ends: 967 [2025-02-05 10:39:41,362 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-02-05 10:39:41,362 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-02-05 10:39:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2025-02-05 10:39:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.5466804979253113) internal successors, (1491), 964 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1491 transitions. [2025-02-05 10:39:41,385 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1491 transitions. Word has length 21 [2025-02-05 10:39:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,386 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1491 transitions. [2025-02-05 10:39:41,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1491 transitions. [2025-02-05 10:39:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:39:41,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:39:41,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash -481764738, now seen corresponding path program 1 times [2025-02-05 10:39:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352567912] [2025-02-05 10:39:41,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:39:41,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:39:41,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352567912] [2025-02-05 10:39:41,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352567912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942275166] [2025-02-05 10:39:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,415 INFO L87 Difference]: Start difference. First operand 965 states and 1491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,454 INFO L93 Difference]: Finished difference Result 1449 states and 2229 transitions. [2025-02-05 10:39:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:39:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,457 INFO L225 Difference]: With dead ends: 1449 [2025-02-05 10:39:41,457 INFO L226 Difference]: Without dead ends: 983 [2025-02-05 10:39:41,458 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-02-05 10:39:41,458 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2025-02-05 10:39:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2025-02-05 10:39:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.5214285714285714) internal successors, (1491), 980 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1491 transitions. [2025-02-05 10:39:41,484 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1491 transitions. Word has length 22 [2025-02-05 10:39:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,484 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1491 transitions. [2025-02-05 10:39:41,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1491 transitions. [2025-02-05 10:39:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:39:41,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 10:39:41,485 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -987323363, now seen corresponding path program 1 times [2025-02-05 10:39:41,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074733032] [2025-02-05 10:39:41,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:39:41,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:39:41,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074733032] [2025-02-05 10:39:41,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074733032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34322530] [2025-02-05 10:39:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,501 INFO L87 Difference]: Start difference. First operand 981 states and 1491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,528 INFO L93 Difference]: Finished difference Result 1737 states and 2693 transitions. [2025-02-05 10:39:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:39:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,533 INFO L225 Difference]: With dead ends: 1737 [2025-02-05 10:39:41,533 INFO L226 Difference]: Without dead ends: 1735 [2025-02-05 10:39:41,533 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-02-05 10:39:41,533 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 117 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2025-02-05 10:39:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1413. [2025-02-05 10:39:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.475212464589235) internal successors, (2083), 1412 states have internal predecessors, (2083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2083 transitions. [2025-02-05 10:39:41,561 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2083 transitions. Word has length 22 [2025-02-05 10:39:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,561 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2083 transitions. [2025-02-05 10:39:41,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2083 transitions. [2025-02-05 10:39:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:39:41,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 10:39:41,562 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1280726370, now seen corresponding path program 1 times [2025-02-05 10:39:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951213104] [2025-02-05 10:39:41,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:39:41,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:39:41,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951213104] [2025-02-05 10:39:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951213104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423267993] [2025-02-05 10:39:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,577 INFO L87 Difference]: Start difference. First operand 1413 states and 2083 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,611 INFO L93 Difference]: Finished difference Result 3273 states and 4837 transitions. [2025-02-05 10:39:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:39:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,615 INFO L225 Difference]: With dead ends: 3273 [2025-02-05 10:39:41,615 INFO L226 Difference]: Without dead ends: 1895 [2025-02-05 10:39:41,617 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-02-05 10:39:41,617 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-02-05 10:39:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2025-02-05 10:39:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.4561310782241015) internal successors, (2755), 1892 states have internal predecessors, (2755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2755 transitions. [2025-02-05 10:39:41,675 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2755 transitions. Word has length 22 [2025-02-05 10:39:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,676 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2755 transitions. [2025-02-05 10:39:41,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2755 transitions. [2025-02-05 10:39:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:39:41,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:39:41,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -542226425, now seen corresponding path program 1 times [2025-02-05 10:39:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628031303] [2025-02-05 10:39:41,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:39:41,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:39:41,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628031303] [2025-02-05 10:39:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628031303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093884776] [2025-02-05 10:39:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,692 INFO L87 Difference]: Start difference. First operand 1893 states and 2755 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,723 INFO L93 Difference]: Finished difference Result 2841 states and 4117 transitions. [2025-02-05 10:39:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 10:39:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,728 INFO L225 Difference]: With dead ends: 2841 [2025-02-05 10:39:41,728 INFO L226 Difference]: Without dead ends: 1927 [2025-02-05 10:39:41,729 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-02-05 10:39:41,729 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2025-02-05 10:39:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1925. [2025-02-05 10:39:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.431912681912682) internal successors, (2755), 1924 states have internal predecessors, (2755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2755 transitions. [2025-02-05 10:39:41,785 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2755 transitions. Word has length 23 [2025-02-05 10:39:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,785 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2755 transitions. [2025-02-05 10:39:41,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2755 transitions. [2025-02-05 10:39:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:39:41,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 10:39:41,788 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1047785050, now seen corresponding path program 1 times [2025-02-05 10:39:41,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186931837] [2025-02-05 10:39:41,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:39:41,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:39:41,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186931837] [2025-02-05 10:39:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186931837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950654776] [2025-02-05 10:39:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,806 INFO L87 Difference]: Start difference. First operand 1925 states and 2755 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:41,870 INFO L93 Difference]: Finished difference Result 3337 states and 4869 transitions. [2025-02-05 10:39:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:41,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 10:39:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:41,879 INFO L225 Difference]: With dead ends: 3337 [2025-02-05 10:39:41,879 INFO L226 Difference]: Without dead ends: 3335 [2025-02-05 10:39:41,880 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-02-05 10:39:41,881 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:41,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-02-05 10:39:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2821. [2025-02-05 10:39:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.3854609929078014) internal successors, (3907), 2820 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 3907 transitions. [2025-02-05 10:39:41,954 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 3907 transitions. Word has length 23 [2025-02-05 10:39:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:41,954 INFO L471 AbstractCegarLoop]: Abstraction has 2821 states and 3907 transitions. [2025-02-05 10:39:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 3907 transitions. [2025-02-05 10:39:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:39:41,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:41,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 10:39:41,958 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1341188057, now seen corresponding path program 1 times [2025-02-05 10:39:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73139404] [2025-02-05 10:39:41,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:41,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:39:41,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:39:41,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:41,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73139404] [2025-02-05 10:39:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73139404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:41,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754695469] [2025-02-05 10:39:41,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:41,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:41,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:41,981 INFO L87 Difference]: Start difference. First operand 2821 states and 3907 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:42,057 INFO L93 Difference]: Finished difference Result 6473 states and 8965 transitions. [2025-02-05 10:39:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-05 10:39:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:42,066 INFO L225 Difference]: With dead ends: 6473 [2025-02-05 10:39:42,066 INFO L226 Difference]: Without dead ends: 3719 [2025-02-05 10:39:42,068 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-02-05 10:39:42,068 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:42,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-02-05 10:39:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2025-02-05 10:39:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3716 states have (on average 1.3614101184068892) internal successors, (5059), 3716 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5059 transitions. [2025-02-05 10:39:42,192 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5059 transitions. Word has length 23 [2025-02-05 10:39:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:42,192 INFO L471 AbstractCegarLoop]: Abstraction has 3717 states and 5059 transitions. [2025-02-05 10:39:42,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5059 transitions. [2025-02-05 10:39:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:39:42,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:42,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:42,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 10:39:42,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:42,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1878428357, now seen corresponding path program 1 times [2025-02-05 10:39:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:42,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367160094] [2025-02-05 10:39:42,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:42,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:39:42,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:39:42,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:42,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:42,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367160094] [2025-02-05 10:39:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367160094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:42,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:42,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355789974] [2025-02-05 10:39:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:42,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:42,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:42,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:42,209 INFO L87 Difference]: Start difference. First operand 3717 states and 5059 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:42,258 INFO L93 Difference]: Finished difference Result 5577 states and 7557 transitions. [2025-02-05 10:39:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:39:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:42,267 INFO L225 Difference]: With dead ends: 5577 [2025-02-05 10:39:42,267 INFO L226 Difference]: Without dead ends: 3783 [2025-02-05 10:39:42,268 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-02-05 10:39:42,269 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:42,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2025-02-05 10:39:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2025-02-05 10:39:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3780 states have (on average 1.3383597883597884) internal successors, (5059), 3780 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5059 transitions. [2025-02-05 10:39:42,337 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5059 transitions. Word has length 24 [2025-02-05 10:39:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:42,337 INFO L471 AbstractCegarLoop]: Abstraction has 3781 states and 5059 transitions. [2025-02-05 10:39:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5059 transitions. [2025-02-05 10:39:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:39:42,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:42,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:42,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 10:39:42,339 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:42,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1372869732, now seen corresponding path program 1 times [2025-02-05 10:39:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407499141] [2025-02-05 10:39:42,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:42,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:39:42,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:39:42,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:42,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:42,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:42,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407499141] [2025-02-05 10:39:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407499141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:42,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:42,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:42,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559308262] [2025-02-05 10:39:42,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:42,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:42,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:42,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:42,353 INFO L87 Difference]: Start difference. First operand 3781 states and 5059 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:42,436 INFO L93 Difference]: Finished difference Result 6409 states and 8709 transitions. [2025-02-05 10:39:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:42,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:39:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:42,449 INFO L225 Difference]: With dead ends: 6409 [2025-02-05 10:39:42,449 INFO L226 Difference]: Without dead ends: 6407 [2025-02-05 10:39:42,450 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-02-05 10:39:42,450 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:42,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2025-02-05 10:39:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 5637. [2025-02-05 10:39:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.2950674237047552) internal successors, (7299), 5636 states have internal predecessors, (7299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 7299 transitions. [2025-02-05 10:39:42,550 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 7299 transitions. Word has length 24 [2025-02-05 10:39:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:42,550 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 7299 transitions. [2025-02-05 10:39:42,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 7299 transitions. [2025-02-05 10:39:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:39:42,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:42,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:42,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 10:39:42,555 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:42,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1079466725, now seen corresponding path program 1 times [2025-02-05 10:39:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:42,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712021429] [2025-02-05 10:39:42,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:42,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:39:42,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:39:42,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:42,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:42,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712021429] [2025-02-05 10:39:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712021429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:42,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213802016] [2025-02-05 10:39:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:42,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:42,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:42,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:42,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:42,574 INFO L87 Difference]: Start difference. First operand 5637 states and 7299 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:42,684 INFO L93 Difference]: Finished difference Result 12809 states and 16517 transitions. [2025-02-05 10:39:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:39:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:42,700 INFO L225 Difference]: With dead ends: 12809 [2025-02-05 10:39:42,700 INFO L226 Difference]: Without dead ends: 7303 [2025-02-05 10:39:42,704 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-02-05 10:39:42,705 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:42,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2025-02-05 10:39:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7301. [2025-02-05 10:39:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 1.2628767123287672) internal successors, (9219), 7300 states have internal predecessors, (9219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 9219 transitions. [2025-02-05 10:39:42,841 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 9219 transitions. Word has length 24 [2025-02-05 10:39:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:42,841 INFO L471 AbstractCegarLoop]: Abstraction has 7301 states and 9219 transitions. [2025-02-05 10:39:42,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 9219 transitions. [2025-02-05 10:39:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:39:42,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:42,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:42,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 10:39:42,846 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:42,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -390684946, now seen corresponding path program 1 times [2025-02-05 10:39:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376718371] [2025-02-05 10:39:42,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:42,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:39:42,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:39:42,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:42,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376718371] [2025-02-05 10:39:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376718371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333774417] [2025-02-05 10:39:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:42,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:42,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:42,864 INFO L87 Difference]: Start difference. First operand 7301 states and 9219 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:42,977 INFO L93 Difference]: Finished difference Result 10953 states and 13765 transitions. [2025-02-05 10:39:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:42,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 10:39:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:42,988 INFO L225 Difference]: With dead ends: 10953 [2025-02-05 10:39:42,988 INFO L226 Difference]: Without dead ends: 7431 [2025-02-05 10:39:42,992 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-02-05 10:39:42,992 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:42,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2025-02-05 10:39:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7429. [2025-02-05 10:39:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 7428 states have (on average 1.2411147011308563) internal successors, (9219), 7428 states have internal predecessors, (9219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 9219 transitions. [2025-02-05 10:39:43,176 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 9219 transitions. Word has length 25 [2025-02-05 10:39:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:43,176 INFO L471 AbstractCegarLoop]: Abstraction has 7429 states and 9219 transitions. [2025-02-05 10:39:43,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 9219 transitions. [2025-02-05 10:39:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:39:43,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:43,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:43,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 10:39:43,182 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:43,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:43,182 INFO L85 PathProgramCache]: Analyzing trace with hash -896243571, now seen corresponding path program 1 times [2025-02-05 10:39:43,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:43,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624524724] [2025-02-05 10:39:43,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:43,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:39:43,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:39:43,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:43,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624524724] [2025-02-05 10:39:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624524724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:43,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:43,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402281464] [2025-02-05 10:39:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:43,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:43,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:43,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:43,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:43,198 INFO L87 Difference]: Start difference. First operand 7429 states and 9219 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:43,342 INFO L93 Difference]: Finished difference Result 12297 states and 15365 transitions. [2025-02-05 10:39:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:43,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 10:39:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:43,358 INFO L225 Difference]: With dead ends: 12297 [2025-02-05 10:39:43,358 INFO L226 Difference]: Without dead ends: 12295 [2025-02-05 10:39:43,360 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-02-05 10:39:43,360 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:43,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2025-02-05 10:39:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 11269. [2025-02-05 10:39:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.2043840965566206) internal successors, (13571), 11268 states have internal predecessors, (13571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13571 transitions. [2025-02-05 10:39:43,518 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13571 transitions. Word has length 25 [2025-02-05 10:39:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:43,518 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 13571 transitions. [2025-02-05 10:39:43,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13571 transitions. [2025-02-05 10:39:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:39:43,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:43,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:43,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 10:39:43,527 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:43,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1189646578, now seen corresponding path program 1 times [2025-02-05 10:39:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:43,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584811625] [2025-02-05 10:39:43,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:43,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 10:39:43,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:39:43,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:43,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584811625] [2025-02-05 10:39:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584811625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866637226] [2025-02-05 10:39:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:43,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:43,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:43,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:43,541 INFO L87 Difference]: Start difference. First operand 11269 states and 13571 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:43,693 INFO L93 Difference]: Finished difference Result 25353 states and 30213 transitions. [2025-02-05 10:39:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 10:39:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:43,712 INFO L225 Difference]: With dead ends: 25353 [2025-02-05 10:39:43,712 INFO L226 Difference]: Without dead ends: 14343 [2025-02-05 10:39:43,721 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-02-05 10:39:43,722 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:43,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2025-02-05 10:39:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 14341. [2025-02-05 10:39:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.1605997210599721) internal successors, (16643), 14340 states have internal predecessors, (16643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 16643 transitions. [2025-02-05 10:39:43,975 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 16643 transitions. Word has length 25 [2025-02-05 10:39:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:43,976 INFO L471 AbstractCegarLoop]: Abstraction has 14341 states and 16643 transitions. [2025-02-05 10:39:43,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 16643 transitions. [2025-02-05 10:39:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:39:43,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:43,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 10:39:43,985 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2013720820, now seen corresponding path program 1 times [2025-02-05 10:39:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425907467] [2025-02-05 10:39:43,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:43,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:39:43,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:39:43,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:43,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:43,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425907467] [2025-02-05 10:39:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425907467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:43,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:43,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568163802] [2025-02-05 10:39:43,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:43,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:43,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:43,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:43,999 INFO L87 Difference]: Start difference. First operand 14341 states and 16643 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:44,110 INFO L93 Difference]: Finished difference Result 21513 states and 24837 transitions. [2025-02-05 10:39:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:39:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:44,130 INFO L225 Difference]: With dead ends: 21513 [2025-02-05 10:39:44,130 INFO L226 Difference]: Without dead ends: 14599 [2025-02-05 10:39:44,138 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-02-05 10:39:44,139 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:44,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14599 states. [2025-02-05 10:39:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14599 to 14597. [2025-02-05 10:39:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14597 states, 14596 states have (on average 1.1402439024390243) internal successors, (16643), 14596 states have internal predecessors, (16643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14597 states to 14597 states and 16643 transitions. [2025-02-05 10:39:44,497 INFO L78 Accepts]: Start accepts. Automaton has 14597 states and 16643 transitions. Word has length 26 [2025-02-05 10:39:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:44,498 INFO L471 AbstractCegarLoop]: Abstraction has 14597 states and 16643 transitions. [2025-02-05 10:39:44,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14597 states and 16643 transitions. [2025-02-05 10:39:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:39:44,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:44,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:44,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 10:39:44,510 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:44,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1775687851, now seen corresponding path program 1 times [2025-02-05 10:39:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733419490] [2025-02-05 10:39:44,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:44,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:39:44,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:39:44,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:44,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733419490] [2025-02-05 10:39:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733419490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120913927] [2025-02-05 10:39:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:44,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:44,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:44,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:44,532 INFO L87 Difference]: Start difference. First operand 14597 states and 16643 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:44,861 INFO L93 Difference]: Finished difference Result 23559 states and 26628 transitions. [2025-02-05 10:39:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:44,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:39:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:44,894 INFO L225 Difference]: With dead ends: 23559 [2025-02-05 10:39:44,894 INFO L226 Difference]: Without dead ends: 23557 [2025-02-05 10:39:44,901 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-02-05 10:39:44,902 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:44,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23557 states. [2025-02-05 10:39:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23557 to 22533. [2025-02-05 10:39:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.11357180898278) internal successors, (25091), 22532 states have internal predecessors, (25091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 25091 transitions. [2025-02-05 10:39:45,205 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 25091 transitions. Word has length 26 [2025-02-05 10:39:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:45,205 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 25091 transitions. [2025-02-05 10:39:45,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 25091 transitions. [2025-02-05 10:39:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:39:45,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:45,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 10:39:45,223 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:45,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1482284844, now seen corresponding path program 1 times [2025-02-05 10:39:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490649787] [2025-02-05 10:39:45,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:45,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:39:45,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:39:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:39:45,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:45,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490649787] [2025-02-05 10:39:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490649787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:45,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:45,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130903159] [2025-02-05 10:39:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:45,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:45,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:45,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:45,238 INFO L87 Difference]: Start difference. First operand 22533 states and 25091 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:45,519 INFO L93 Difference]: Finished difference Result 50181 states and 54787 transitions. [2025-02-05 10:39:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:39:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:45,521 INFO L225 Difference]: With dead ends: 50181 [2025-02-05 10:39:45,521 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:39:45,541 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-02-05 10:39:45,542 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:45,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:39:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:39:45,542 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-02-05 10:39:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:39:45,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-02-05 10:39:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:45,543 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:39:45,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:39:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:39:45,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:39:45,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:39:45,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 10:39:45,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:45,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:39:45,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:39:45,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:39:45 BoogieIcfgContainer [2025-02-05 10:39:45,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:39:45,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:39:45,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:39:45,567 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:39:45,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:39:40" (3/4) ... [2025-02-05 10:39:45,569 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:39:45,574 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-05 10:39:45,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:39:45,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:39:45,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:39:45,625 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:39:45,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:39:45,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:39:45,626 INFO L158 Benchmark]: Toolchain (without parser) took 5991.66ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 106.0MB in the beginning and 725.0MB in the end (delta: -619.0MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. [2025-02-05 10:39:45,626 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:45,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.53ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:39:45,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.3MB in the end (delta: 864.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:45,627 INFO L158 Benchmark]: Boogie Preprocessor took 26.83ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:39:45,627 INFO L158 Benchmark]: IcfgBuilder took 292.96ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 77.4MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:39:45,628 INFO L158 Benchmark]: TraceAbstraction took 5406.16ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 76.5MB in the beginning and 729.2MB in the end (delta: -652.7MB). Peak memory consumption was 181.4MB. Max. memory is 16.1GB. [2025-02-05 10:39:45,629 INFO L158 Benchmark]: Witness Printer took 58.99ms. Allocated memory is still 973.1MB. Free memory was 729.2MB in the beginning and 725.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:45,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.53ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.3MB in the end (delta: 864.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.83ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 292.96ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 77.4MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5406.16ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 76.5MB in the beginning and 729.2MB in the end (delta: -652.7MB). Peak memory consumption was 181.4MB. Max. memory is 16.1GB. * Witness Printer took 58.99ms. Allocated memory is still 973.1MB. Free memory was 729.2MB in the beginning and 725.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 163]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1194 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1194 mSDsluCounter, 3958 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1588 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 2370 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22533occurred in iteration=28, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 4126 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-05 10:39:45,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE