./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono5_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/Mono5_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d27ce9425b362883f32c5ccf3973d31d4f8100e5e6b8fcc1a4527c07eb2b71c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:35:39,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:35:39,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:35:39,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:35:39,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:35:39,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:35:39,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:35:39,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:35:39,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:35:39,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:35:39,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:35:39,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:35:39,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:35:39,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:35:39,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:35:39,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:35:39,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:35:39,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:35:39,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:35:39,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:35:39,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:35:39,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:35:39,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:35:39,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:35:39,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:35:39,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:35:39,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:35:39,915 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d27ce9425b362883f32c5ccf3973d31d4f8100e5e6b8fcc1a4527c07eb2b71c [2025-03-03 13:35:40,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:35:40,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:35:40,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:35:40,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:35:40,136 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:35:40,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono5_1.c [2025-03-03 13:35:41,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52250ee92/6423fc5f2566400298cab09bfd3a2f90/FLAG23a86a4bc [2025-03-03 13:35:41,450 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:35:41,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono5_1.c [2025-03-03 13:35:41,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52250ee92/6423fc5f2566400298cab09bfd3a2f90/FLAG23a86a4bc [2025-03-03 13:35:41,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52250ee92/6423fc5f2566400298cab09bfd3a2f90 [2025-03-03 13:35:41,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:35:41,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:35:41,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:35:41,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:35:41,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:35:41,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:41,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efdf38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41, skipping insertion in model container [2025-03-03 13:35:41,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:41,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:35:41,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono5_1.c[311,324] [2025-03-03 13:35:41,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:35:41,955 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:35:41,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono5_1.c[311,324] [2025-03-03 13:35:41,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:35:41,974 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:35:41,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41 WrapperNode [2025-03-03 13:35:41,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:35:41,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:35:41,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:35:41,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:35:41,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:41,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:41,995 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2025-03-03 13:35:41,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:35:41,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:35:41,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:35:41,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:35:42,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,011 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:35:42,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:35:42,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:35:42,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:35:42,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:35:42,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (1/1) ... [2025-03-03 13:35:42,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:35:42,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:42,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:35:42,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:35:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:35:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:35:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:35:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:35:42,099 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:35:42,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:35:42,172 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 13:35:42,173 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:35:42,182 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:35:42,182 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:35:42,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:35:42 BoogieIcfgContainer [2025-03-03 13:35:42,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:35:42,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:35:42,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:35:42,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:35:42,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:35:41" (1/3) ... [2025-03-03 13:35:42,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f8f3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:35:42, skipping insertion in model container [2025-03-03 13:35:42,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:35:41" (2/3) ... [2025-03-03 13:35:42,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f8f3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:35:42, skipping insertion in model container [2025-03-03 13:35:42,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:35:42" (3/3) ... [2025-03-03 13:35:42,190 INFO L128 eAbstractionObserver]: Analyzing ICFG Mono5_1.c [2025-03-03 13:35:42,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:35:42,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Mono5_1.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:35:42,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:35:42,246 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;@6d1c510e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:35:42,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:35:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 13:35:42,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:42,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 13:35:42,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:42,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash 40044997, now seen corresponding path program 1 times [2025-03-03 13:35:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978063374] [2025-03-03 13:35:42,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:42,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 13:35:42,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 13:35:42,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:42,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978063374] [2025-03-03 13:35:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978063374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:35:42,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:35:42,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:35:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714288505] [2025-03-03 13:35:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:35:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:35:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:42,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:35:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:35:42,544 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:42,581 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-03-03 13:35:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:35:42,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-03 13:35:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:42,587 INFO L225 Difference]: With dead ends: 22 [2025-03-03 13:35:42,587 INFO L226 Difference]: Without dead ends: 11 [2025-03-03 13:35:42,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:35:42,593 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:42,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:35:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-03 13:35:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-03 13:35:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-03 13:35:42,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2025-03-03 13:35:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:42,616 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-03 13:35:42,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-03-03 13:35:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:35:42,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:42,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:35:42,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:35:42,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:42,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash -902066916, now seen corresponding path program 1 times [2025-03-03 13:35:42,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:42,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923262294] [2025-03-03 13:35:42,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:42,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:35:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:35:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:42,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:42,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923262294] [2025-03-03 13:35:42,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923262294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:35:42,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:35:42,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:35:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717847805] [2025-03-03 13:35:42,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:35:42,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:35:42,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:42,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:35:42,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:35:42,692 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:42,703 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-03-03 13:35:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:35:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-03 13:35:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:42,704 INFO L225 Difference]: With dead ends: 20 [2025-03-03 13:35:42,704 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 13:35:42,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:35:42,705 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 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-03-03 13:35:42,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:35:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 13:35:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-03 13:35:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-03 13:35:42,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2025-03-03 13:35:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:42,707 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-03 13:35:42,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-03 13:35:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 13:35:42,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:42,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:35:42,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:35:42,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:42,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1996022596, now seen corresponding path program 1 times [2025-03-03 13:35:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:42,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169121937] [2025-03-03 13:35:42,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:42,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:35:42,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:35:42,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:42,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:35:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169121937] [2025-03-03 13:35:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169121937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490897617] [2025-03-03 13:35:42,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:35:42,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:42,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:42,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:35:42,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:35:42,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:35:42,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:35:42,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:35:42,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:42,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:35:42,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:35:42,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:35:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490897617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:42,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2025-03-03 13:35:42,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704180389] [2025-03-03 13:35:42,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:42,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:35:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:42,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:35:42,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:35:42,955 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-03-03 13:35:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:43,032 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-03-03 13:35:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:35:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 11 [2025-03-03 13:35:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:43,034 INFO L225 Difference]: With dead ends: 33 [2025-03-03 13:35:43,034 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 13:35:43,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:35:43,034 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:43,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 34 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:35:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 13:35:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-03 13:35:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-03 13:35:43,041 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2025-03-03 13:35:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:43,041 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-03 13:35:43,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-03-03 13:35:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-03 13:35:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:35:43,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:43,041 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1] [2025-03-03 13:35:43,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:35:43,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:43,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:43,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1975704581, now seen corresponding path program 2 times [2025-03-03 13:35:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672280382] [2025-03-03 13:35:43,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:35:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:43,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:35:43,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:35:43,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:35:43,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:35:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672280382] [2025-03-03 13:35:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672280382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20804211] [2025-03-03 13:35:43,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:35:43,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:43,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:43,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:35:43,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:35:43,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:35:43,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:35:43,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:35:43,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:43,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 13:35:43,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:35:43,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:35:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20804211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:43,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-03 13:35:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191921728] [2025-03-03 13:35:43,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:43,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 13:35:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 13:35:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:35:43,684 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:43,834 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2025-03-03 13:35:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:35:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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-03-03 13:35:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:43,835 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:35:43,835 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 13:35:43,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:35:43,836 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:43,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 148 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:35:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 13:35:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-03 13:35:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-03 13:35:43,845 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 23 [2025-03-03 13:35:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:43,845 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-03 13:35:43,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-03-03 13:35:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 13:35:43,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:43,847 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1] [2025-03-03 13:35:43,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:35:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 13:35:44,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:44,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1709107685, now seen corresponding path program 3 times [2025-03-03 13:35:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192668910] [2025-03-03 13:35:44,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:35:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:44,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 13 equivalence classes. [2025-03-03 13:35:44,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 29 of 41 statements. [2025-03-03 13:35:44,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 13:35:44,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 7 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-03 13:35:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192668910] [2025-03-03 13:35:44,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192668910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:44,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647927521] [2025-03-03 13:35:44,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:35:44,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:44,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:35:44,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:35:44,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 13 equivalence classes. [2025-03-03 13:35:44,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 29 of 41 statements. [2025-03-03 13:35:44,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 13:35:44,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:44,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:35:44,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 7 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-03 13:35:44,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 77 proven. 7 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-03 13:35:44,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647927521] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:44,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:35:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957129343] [2025-03-03 13:35:44,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:44,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:35:44,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:44,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:35:44,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:35:44,304 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:44,371 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2025-03-03 13:35:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:35:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 13:35:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:44,372 INFO L225 Difference]: With dead ends: 98 [2025-03-03 13:35:44,372 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 13:35:44,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:35:44,373 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:44,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 18 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:35:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 13:35:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2025-03-03 13:35:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-03-03 13:35:44,382 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 41 [2025-03-03 13:35:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-03-03 13:35:44,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-03-03 13:35:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 13:35:44,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:44,383 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 1, 1, 1, 1, 1] [2025-03-03 13:35:44,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:35:44,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:44,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:44,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash 356846565, now seen corresponding path program 4 times [2025-03-03 13:35:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:44,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936529726] [2025-03-03 13:35:44,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:35:44,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:44,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-03 13:35:44,608 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:35:44,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:35:44,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 193 proven. 57 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-03 13:35:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936529726] [2025-03-03 13:35:44,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936529726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:44,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529452990] [2025-03-03 13:35:44,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:35:44,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:44,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:44,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:35:44,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:35:44,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-03 13:35:44,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 13:35:44,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:35:44,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:44,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 13:35:44,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 13:35:45,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 13:35:45,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529452990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:45,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:45,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 32 [2025-03-03 13:35:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139181168] [2025-03-03 13:35:45,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:45,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 13:35:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:45,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 13:35:45,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2025-03-03 13:35:45,373 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 32 states, 32 states have (on average 3.03125) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:46,462 INFO L93 Difference]: Finished difference Result 129 states and 175 transitions. [2025-03-03 13:35:46,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 13:35:46,462 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.03125) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 13:35:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:46,463 INFO L225 Difference]: With dead ends: 129 [2025-03-03 13:35:46,463 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 13:35:46,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=615, Invalid=1737, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:35:46,464 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 135 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:46,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 436 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:35:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 13:35:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-03 13:35:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2025-03-03 13:35:46,480 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 53 [2025-03-03 13:35:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:46,481 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2025-03-03 13:35:46,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.03125) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2025-03-03 13:35:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 13:35:46,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:46,484 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 22, 7, 1, 1, 1, 1, 1] [2025-03-03 13:35:46,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:35:46,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:46,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:46,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1048116861, now seen corresponding path program 5 times [2025-03-03 13:35:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:46,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28085119] [2025-03-03 13:35:46,686 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:35:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:46,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 30 equivalence classes. [2025-03-03 13:35:46,771 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 13:35:46,772 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2025-03-03 13:35:46,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 498 proven. 77 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-03-03 13:35:46,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:46,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28085119] [2025-03-03 13:35:46,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28085119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:46,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446830130] [2025-03-03 13:35:46,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:35:46,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:46,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:46,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:35:46,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:35:46,978 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 30 equivalence classes. [2025-03-03 13:35:47,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 13:35:47,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2025-03-03 13:35:47,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:47,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-03 13:35:47,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-03 13:35:47,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-03 13:35:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446830130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:48,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:48,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 26, 26] total 57 [2025-03-03 13:35:48,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712842415] [2025-03-03 13:35:48,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:48,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 13:35:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:48,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 13:35:48,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=2545, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 13:35:48,390 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 57 states, 57 states have (on average 3.017543859649123) internal successors, (172), 57 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:35:57,329 INFO L93 Difference]: Finished difference Result 240 states and 334 transitions. [2025-03-03 13:35:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-03 13:35:57,330 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.017543859649123) internal successors, (172), 57 states have internal predecessors, (172), 0 states have call successors, (0), 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 92 [2025-03-03 13:35:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:35:57,330 INFO L225 Difference]: With dead ends: 240 [2025-03-03 13:35:57,330 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 13:35:57,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2109, Invalid=5373, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 13:35:57,336 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 468 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:35:57,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1759 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 13:35:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 13:35:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2025-03-03 13:35:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 168 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 216 transitions. [2025-03-03 13:35:57,359 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 216 transitions. Word has length 92 [2025-03-03 13:35:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:35:57,359 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 216 transitions. [2025-03-03 13:35:57,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.017543859649123) internal successors, (172), 57 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:35:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 216 transitions. [2025-03-03 13:35:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 13:35:57,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:35:57,361 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 46, 8, 1, 1, 1, 1, 1] [2025-03-03 13:35:57,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:35:57,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:57,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:35:57,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:35:57,562 INFO L85 PathProgramCache]: Analyzing trace with hash -39929819, now seen corresponding path program 6 times [2025-03-03 13:35:57,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:35:57,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139029468] [2025-03-03 13:35:57,562 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:35:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:35:57,572 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 167 statements into 55 equivalence classes. [2025-03-03 13:35:57,746 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) and asserted 161 of 167 statements. [2025-03-03 13:35:57,747 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2025-03-03 13:35:57,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1187 proven. 100 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2025-03-03 13:35:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:35:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139029468] [2025-03-03 13:35:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139029468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:35:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243843880] [2025-03-03 13:35:58,037 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:35:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:35:58,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:35:58,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:35:58,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:35:58,081 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 167 statements into 55 equivalence classes. [2025-03-03 13:35:59,220 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) and asserted 161 of 167 statements. [2025-03-03 13:35:59,221 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 53 check-sat command(s) [2025-03-03 13:35:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:35:59,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:35:59,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:35:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1187 proven. 100 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2025-03-03 13:35:59,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:35:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1187 proven. 100 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2025-03-03 13:35:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243843880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:35:59,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:35:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-03 13:35:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375328457] [2025-03-03 13:35:59,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:35:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 13:35:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:35:59,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 13:35:59,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:35:59,409 INFO L87 Difference]: Start difference. First operand 169 states and 216 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:36:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:36:00,526 INFO L93 Difference]: Finished difference Result 386 states and 489 transitions. [2025-03-03 13:36:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:36:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 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 167 [2025-03-03 13:36:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:36:00,527 INFO L225 Difference]: With dead ends: 386 [2025-03-03 13:36:00,527 INFO L226 Difference]: Without dead ends: 245 [2025-03-03 13:36:00,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2025-03-03 13:36:00,528 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:36:00,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:36:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-03 13:36:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 199. [2025-03-03 13:36:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.2424242424242424) internal successors, (246), 198 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:36:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 246 transitions. [2025-03-03 13:36:00,546 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 246 transitions. Word has length 167 [2025-03-03 13:36:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:36:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 246 transitions. [2025-03-03 13:36:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:36:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 246 transitions. [2025-03-03 13:36:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 13:36:00,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:36:00,548 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 46, 18, 1, 1, 1, 1, 1] [2025-03-03 13:36:00,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:36:00,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:00,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:36:00,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:36:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1877103323, now seen corresponding path program 7 times [2025-03-03 13:36:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:36:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060141406] [2025-03-03 13:36:00,749 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:36:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:36:00,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 13:36:00,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 13:36:00,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:00,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 2557 proven. 495 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2025-03-03 13:36:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:36:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060141406] [2025-03-03 13:36:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060141406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:36:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938174084] [2025-03-03 13:36:01,416 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:36:01,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:36:01,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:36:01,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:36:01,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:36:01,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 13:36:01,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 13:36:01,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:36:01,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:36:01,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-03 13:36:01,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:36:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 5617 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 13:36:02,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:36:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 5617 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 13:36:05,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938174084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:36:05,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:36:05,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 50, 50] total 117 [2025-03-03 13:36:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041583541] [2025-03-03 13:36:05,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:36:05,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2025-03-03 13:36:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:36:05,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2025-03-03 13:36:05,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2459, Invalid=11113, Unknown=0, NotChecked=0, Total=13572 [2025-03-03 13:36:05,906 INFO L87 Difference]: Start difference. First operand 199 states and 246 transitions. Second operand has 117 states, 117 states have (on average 2.9914529914529915) internal successors, (350), 117 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:36:23,235 WARN L286 SmtUtils]: Spent 10.47s on a formula simplification that was a NOOP. DAG size: 237 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:36:36,918 WARN L286 SmtUtils]: Spent 9.83s on a formula simplification that was a NOOP. DAG size: 232 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:36:50,533 WARN L286 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:37:01,969 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 222 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:37:14,879 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:37:25,647 WARN L286 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 212 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)