./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal174.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal174.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8a2798213217014f89590aee563a02c6e6cd2e891bb884e72d6301c43422dc29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:43:16,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:43:16,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 06:43:16,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:43:16,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:43:16,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:43:16,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:43:16,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:43:16,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:43:16,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:43:16,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:43:16,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:43:16,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:43:16,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:43:16,920 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:43:16,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:43:16,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:43:16,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:43:16,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:43:16,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:43:16,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:43:16,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:43:16,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:43:16,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:43:16,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:43:16,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:43:16,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:43:16,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:43:16,923 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a2798213217014f89590aee563a02c6e6cd2e891bb884e72d6301c43422dc29 [2025-01-09 06:43:17,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:43:17,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:43:17,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:43:17,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:43:17,165 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:43:17,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal174.c [2025-01-09 06:43:19,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcfa08011/64a9d4b875924d77b8bddb6ef7ac0e9c/FLAGee1341f1e [2025-01-09 06:43:19,523 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:43:19,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal174.c [2025-01-09 06:43:19,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcfa08011/64a9d4b875924d77b8bddb6ef7ac0e9c/FLAGee1341f1e [2025-01-09 06:43:19,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dcfa08011/64a9d4b875924d77b8bddb6ef7ac0e9c [2025-01-09 06:43:19,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:43:19,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:43:19,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:43:19,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:43:19,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:43:19,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:43:19" (1/1) ... [2025-01-09 06:43:19,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13491ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:19, skipping insertion in model container [2025-01-09 06:43:19,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:43:19" (1/1) ... [2025-01-09 06:43:19,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:43:19,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal174.c[1246,1259] [2025-01-09 06:43:20,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:43:20,962 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:43:20,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal174.c[1246,1259] [2025-01-09 06:43:21,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:43:21,608 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:43:21,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21 WrapperNode [2025-01-09 06:43:21,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:43:21,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:43:21,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:43:21,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:43:21,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:21,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:24,175 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38543 [2025-01-09 06:43:24,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:43:24,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:43:24,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:43:24,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:43:24,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:24,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:25,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:25,512 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-01-09 06:43:25,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:25,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:26,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:26,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:26,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:26,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:26,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:27,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:43:27,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:43:27,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:43:27,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:43:27,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (1/1) ... [2025-01-09 06:43:27,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:43:27,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:43:27,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:43:27,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:43:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:43:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:43:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:43:27,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:43:28,924 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:43:28,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:44:44,251 INFO L? ?]: Removed 21547 outVars from TransFormulas that were not future-live. [2025-01-09 06:44:44,252 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:44:44,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:44:44,361 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 06:44:44,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:44:44 BoogieIcfgContainer [2025-01-09 06:44:44,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:44:44,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:44:44,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:44:44,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:44:44,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:43:19" (1/3) ... [2025-01-09 06:44:44,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654fb506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:44:44, skipping insertion in model container [2025-01-09 06:44:44,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:43:21" (2/3) ... [2025-01-09 06:44:44,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654fb506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:44:44, skipping insertion in model container [2025-01-09 06:44:44,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:44:44" (3/3) ... [2025-01-09 06:44:44,368 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal174.c [2025-01-09 06:44:44,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:44:44,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal174.c that has 1 procedures, 12945 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 06:44:44,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:44:44,563 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;@6dde2311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:44:44,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 06:44:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 12945 states, 12943 states have (on average 1.5001931546009426) internal successors, (19417), 12944 states have internal predecessors, (19417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 06:44:44,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:44:44,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:44:44,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:44:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:44:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -925097481, now seen corresponding path program 1 times [2025-01-09 06:44:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:44:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873781396] [2025-01-09 06:44:44,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:44:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:44:44,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 06:44:44,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 06:44:44,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:44:44,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:44:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:44:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:44:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873781396] [2025-01-09 06:44:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873781396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:44:45,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:44:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:44:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259050354] [2025-01-09 06:44:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:44:45,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:44:45,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:44:45,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:44:45,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:44:45,576 INFO L87 Difference]: Start difference. First operand has 12945 states, 12943 states have (on average 1.5001931546009426) internal successors, (19417), 12944 states have internal predecessors, (19417), 0 states have call successors, (0), 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 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:44:46,008 INFO L93 Difference]: Finished difference Result 25759 states and 38641 transitions. [2025-01-09 06:44:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:44:46,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-01-09 06:44:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:44:46,065 INFO L225 Difference]: With dead ends: 25759 [2025-01-09 06:44:46,065 INFO L226 Difference]: Without dead ends: 12944 [2025-01-09 06:44:46,090 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-01-09 06:44:46,091 INFO L435 NwaCegarLoop]: 19411 mSDtfsCounter, 0 mSDsluCounter, 38816 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58227 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:44:46,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58227 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:44:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2025-01-09 06:44:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 12944. [2025-01-09 06:44:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12944 states, 12943 states have (on average 1.5000386309201885) internal successors, (19415), 12943 states have internal predecessors, (19415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12944 states to 12944 states and 19415 transitions. [2025-01-09 06:44:46,438 INFO L78 Accepts]: Start accepts. Automaton has 12944 states and 19415 transitions. Word has length 111 [2025-01-09 06:44:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:44:46,439 INFO L471 AbstractCegarLoop]: Abstraction has 12944 states and 19415 transitions. [2025-01-09 06:44:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 12944 states and 19415 transitions. [2025-01-09 06:44:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 06:44:46,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:44:46,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:44:46,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:44:46,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:44:46,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:44:46,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1388445003, now seen corresponding path program 1 times [2025-01-09 06:44:46,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:44:46,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53469988] [2025-01-09 06:44:46,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:44:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:44:46,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 06:44:46,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 06:44:46,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:44:46,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:44:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:44:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:44:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53469988] [2025-01-09 06:44:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53469988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:44:46,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:44:46,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:44:46,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549317277] [2025-01-09 06:44:46,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:44:46,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:44:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:44:46,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:44:46,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:44:46,907 INFO L87 Difference]: Start difference. First operand 12944 states and 19415 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:44:47,278 INFO L93 Difference]: Finished difference Result 25760 states and 38639 transitions. [2025-01-09 06:44:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:44:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-01-09 06:44:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:44:47,327 INFO L225 Difference]: With dead ends: 25760 [2025-01-09 06:44:47,329 INFO L226 Difference]: Without dead ends: 12946 [2025-01-09 06:44:47,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:44:47,347 INFO L435 NwaCegarLoop]: 19411 mSDtfsCounter, 0 mSDsluCounter, 38812 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58223 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:44:47,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58223 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:44:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12946 states. [2025-01-09 06:44:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12946 to 12946. [2025-01-09 06:44:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12946 states, 12945 states have (on average 1.4999613750482812) internal successors, (19417), 12945 states have internal predecessors, (19417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12946 states to 12946 states and 19417 transitions. [2025-01-09 06:44:47,606 INFO L78 Accepts]: Start accepts. Automaton has 12946 states and 19417 transitions. Word has length 112 [2025-01-09 06:44:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:44:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 12946 states and 19417 transitions. [2025-01-09 06:44:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 12946 states and 19417 transitions. [2025-01-09 06:44:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 06:44:47,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:44:47,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:44:47,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:44:47,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:44:47,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:44:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1005843120, now seen corresponding path program 1 times [2025-01-09 06:44:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:44:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920494534] [2025-01-09 06:44:47,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:44:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:44:47,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 06:44:47,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 06:44:47,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:44:47,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:44:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:44:48,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:44:48,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920494534] [2025-01-09 06:44:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920494534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:44:48,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:44:48,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:44:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529077041] [2025-01-09 06:44:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:44:48,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:44:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:44:48,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:44:48,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:44:48,348 INFO L87 Difference]: Start difference. First operand 12946 states and 19417 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:44:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:44:49,162 INFO L93 Difference]: Finished difference Result 25855 states and 38775 transitions. [2025-01-09 06:44:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:44:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-01-09 06:44:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:44:49,186 INFO L225 Difference]: With dead ends: 25855 [2025-01-09 06:44:49,187 INFO L226 Difference]: Without dead ends: 13039 [2025-01-09 06:44:49,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:44:49,204 INFO L435 NwaCegarLoop]: 19345 mSDtfsCounter, 19585 mSDsluCounter, 58037 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19585 SdHoareTripleChecker+Valid, 77382 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:44:49,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19585 Valid, 77382 Invalid, 270 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]