./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label42.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/eca-rers2012/Problem13_label42.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 0543a7f62c421ec223229fb3e2bfbf903aa6057da67580bb11646235be2c5e7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:44:27,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:44:27,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:44:27,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:44:27,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:44:27,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:44:27,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:44:27,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:44:27,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:44:27,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:44:27,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:44:27,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:44:27,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:44:27,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:44:27,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:44:27,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:44:27,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:44:27,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:44:27,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:44:27,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:44:27,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:44:27,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:44:27,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:27,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:44:27,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:44:27,130 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 -> 0543a7f62c421ec223229fb3e2bfbf903aa6057da67580bb11646235be2c5e7e [2025-03-03 10:44:27,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:44:27,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:44:27,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:44:27,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:44:27,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:44:27,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label42.c [2025-03-03 10:44:28,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19473a2c/05fae4e2f63f49f39768f5008247902b/FLAG0e53592d7 [2025-03-03 10:44:28,958 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:44:28,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label42.c [2025-03-03 10:44:28,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19473a2c/05fae4e2f63f49f39768f5008247902b/FLAG0e53592d7 [2025-03-03 10:44:29,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19473a2c/05fae4e2f63f49f39768f5008247902b [2025-03-03 10:44:29,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:44:29,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:44:29,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:29,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:44:29,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:44:29,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:29" (1/1) ... [2025-03-03 10:44:29,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfd05b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:29, skipping insertion in model container [2025-03-03 10:44:29,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:29" (1/1) ... [2025-03-03 10:44:29,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:44:29,341 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/eca-rers2012/Problem13_label42.c[9228,9241] [2025-03-03 10:44:29,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:29,813 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:44:29,828 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/eca-rers2012/Problem13_label42.c[9228,9241] [2025-03-03 10:44:30,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:30,108 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:44:30,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30 WrapperNode [2025-03-03 10:44:30,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:30,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:30,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:44:30,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:44:30,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,505 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:44:30,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:30,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:44:30,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:44:30,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:44:30,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,743 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 10:44:30,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:30,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:31,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:44:31,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:44:31,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:44:31,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:44:31,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (1/1) ... [2025-03-03 10:44:31,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:31,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:44:31,061 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 10:44:31,065 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 10:44:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:44:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:44:31,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:44:31,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:44:31,123 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:44:31,125 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:44:35,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:44:35,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:44:35,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:44:35,327 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:44:35,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:44:35,362 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:44:35,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:44:35,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:35 BoogieIcfgContainer [2025-03-03 10:44:35,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:44:35,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:44:35,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:44:35,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:44:35,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:44:29" (1/3) ... [2025-03-03 10:44:35,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3fe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:35, skipping insertion in model container [2025-03-03 10:44:35,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:30" (2/3) ... [2025-03-03 10:44:35,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3fe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:35, skipping insertion in model container [2025-03-03 10:44:35,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:35" (3/3) ... [2025-03-03 10:44:35,369 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label42.c [2025-03-03 10:44:35,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:44:35,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label42.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:44:35,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:44:35,451 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;@317af85b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:44:35,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:44:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 10:44:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 10:44:35,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:35,462 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] [2025-03-03 10:44:35,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:35,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1551459762, now seen corresponding path program 1 times [2025-03-03 10:44:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:35,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161739755] [2025-03-03 10:44:35,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:35,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:35,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 10:44:35,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 10:44:35,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:35,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:35,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:35,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161739755] [2025-03-03 10:44:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161739755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:35,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:35,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55080790] [2025-03-03 10:44:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:35,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:35,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:35,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:35,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:35,999 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 10:44:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:41,222 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-03-03 10:44:41,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:44:41,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 10:44:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:41,244 INFO L225 Difference]: With dead ends: 3829 [2025-03-03 10:44:41,244 INFO L226 Difference]: Without dead ends: 2664 [2025-03-03 10:44:41,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:44:41,250 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2663 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:41,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 1051 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 10:44:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-03 10:44:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-03-03 10:44:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 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 10:44:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-03-03 10:44:41,342 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 65 [2025-03-03 10:44:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:41,342 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-03-03 10:44:41,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 10:44:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-03-03 10:44:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 10:44:41,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:41,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:41,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:44:41,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash -645728577, now seen corresponding path program 1 times [2025-03-03 10:44:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263955673] [2025-03-03 10:44:41,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:41,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 10:44:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 10:44:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:41,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263955673] [2025-03-03 10:44:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263955673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:41,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:41,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283951985] [2025-03-03 10:44:41,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:41,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:41,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:41,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:41,633 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 10:44:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:46,713 INFO L93 Difference]: Finished difference Result 7864 states and 12669 transitions. [2025-03-03 10:44:46,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:44:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2025-03-03 10:44:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:46,734 INFO L225 Difference]: With dead ends: 7864 [2025-03-03 10:44:46,734 INFO L226 Difference]: Without dead ends: 5990 [2025-03-03 10:44:46,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:46,738 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1691 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 5283 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 6126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 5283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:46,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 1068 Invalid, 6126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 5283 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-03 10:44:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2025-03-03 10:44:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 5859. [2025-03-03 10:44:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5859 states, 5858 states have (on average 1.4452031410037556) internal successors, (8466), 5858 states have internal predecessors, (8466), 0 states have call successors, (0), 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 10:44:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 8466 transitions. [2025-03-03 10:44:46,827 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 8466 transitions. Word has length 190 [2025-03-03 10:44:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:46,828 INFO L471 AbstractCegarLoop]: Abstraction has 5859 states and 8466 transitions. [2025-03-03 10:44:46,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 10:44:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 8466 transitions. [2025-03-03 10:44:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 10:44:46,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:46,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:46,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:44:46,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash -518400865, now seen corresponding path program 1 times [2025-03-03 10:44:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5555143] [2025-03-03 10:44:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:46,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 10:44:46,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 10:44:46,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:46,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:44:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5555143] [2025-03-03 10:44:47,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5555143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:47,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:47,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:47,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625986213] [2025-03-03 10:44:47,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:47,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:47,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:47,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:47,073 INFO L87 Difference]: Start difference. First operand 5859 states and 8466 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 10:44:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:49,617 INFO L93 Difference]: Finished difference Result 15687 states and 23390 transitions. [2025-03-03 10:44:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 232 [2025-03-03 10:44:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:49,645 INFO L225 Difference]: With dead ends: 15687 [2025-03-03 10:44:49,645 INFO L226 Difference]: Without dead ends: 10617 [2025-03-03 10:44:49,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:44:49,650 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 919 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:49,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 919 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:44:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10617 states. [2025-03-03 10:44:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10617 to 10608. [2025-03-03 10:44:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3551428302064674) internal successors, (14374), 10607 states have internal predecessors, (14374), 0 states have call successors, (0), 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 10:44:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 14374 transitions. [2025-03-03 10:44:49,778 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 14374 transitions. Word has length 232 [2025-03-03 10:44:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 14374 transitions. [2025-03-03 10:44:49,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 10:44:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 14374 transitions. [2025-03-03 10:44:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 10:44:49,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:49,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:49,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:44:49,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:49,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1068808838, now seen corresponding path program 1 times [2025-03-03 10:44:49,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231946439] [2025-03-03 10:44:49,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:49,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:49,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 10:44:49,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 10:44:49,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:49,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:44:49,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:49,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231946439] [2025-03-03 10:44:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231946439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:49,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846511766] [2025-03-03 10:44:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:49,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:49,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:49,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:49,974 INFO L87 Difference]: Start difference. First operand 10608 states and 14374 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 10:44:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:52,603 INFO L93 Difference]: Finished difference Result 28351 states and 39240 transitions. [2025-03-03 10:44:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 246 [2025-03-03 10:44:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:52,646 INFO L225 Difference]: With dead ends: 28351 [2025-03-03 10:44:52,646 INFO L226 Difference]: Without dead ends: 18532 [2025-03-03 10:44:52,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:44:52,655 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 909 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:52,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 615 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:44:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18532 states. [2025-03-03 10:44:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18532 to 18523. [2025-03-03 10:44:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18523 states, 18522 states have (on average 1.3251268761472843) internal successors, (24544), 18522 states have internal predecessors, (24544), 0 states have call successors, (0), 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 10:44:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18523 states to 18523 states and 24544 transitions. [2025-03-03 10:44:52,937 INFO L78 Accepts]: Start accepts. Automaton has 18523 states and 24544 transitions. Word has length 246 [2025-03-03 10:44:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:52,937 INFO L471 AbstractCegarLoop]: Abstraction has 18523 states and 24544 transitions. [2025-03-03 10:44:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 10:44:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18523 states and 24544 transitions. [2025-03-03 10:44:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 10:44:52,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:52,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:52,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:44:52,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:52,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1711946675, now seen corresponding path program 1 times [2025-03-03 10:44:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978035921] [2025-03-03 10:44:52,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:52,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 10:44:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 10:44:52,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:52,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978035921] [2025-03-03 10:44:53,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978035921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:53,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:53,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:53,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290583385] [2025-03-03 10:44:53,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:53,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:53,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:53,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:53,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:53,167 INFO L87 Difference]: Start difference. First operand 18523 states and 24544 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 10:44:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:55,777 INFO L93 Difference]: Finished difference Result 52015 states and 69799 transitions. [2025-03-03 10:44:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:55,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2025-03-03 10:44:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:55,823 INFO L225 Difference]: With dead ends: 52015 [2025-03-03 10:44:55,823 INFO L226 Difference]: Without dead ends: 34281 [2025-03-03 10:44:55,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:55,844 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 852 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:55,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 947 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:44:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34281 states. [2025-03-03 10:44:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34281 to 34271. [2025-03-03 10:44:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34271 states, 34270 states have (on average 1.25503355704698) internal successors, (43010), 34270 states have internal predecessors, (43010), 0 states have call successors, (0), 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 10:44:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34271 states to 34271 states and 43010 transitions. [2025-03-03 10:44:56,227 INFO L78 Accepts]: Start accepts. Automaton has 34271 states and 43010 transitions. Word has length 264 [2025-03-03 10:44:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:56,227 INFO L471 AbstractCegarLoop]: Abstraction has 34271 states and 43010 transitions. [2025-03-03 10:44:56,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 10:44:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34271 states and 43010 transitions. [2025-03-03 10:44:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 10:44:56,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:56,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:56,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:44:56,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1308411335, now seen corresponding path program 1 times [2025-03-03 10:44:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391030965] [2025-03-03 10:44:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:56,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 10:44:56,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 10:44:56,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:56,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 10:44:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:56,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391030965] [2025-03-03 10:44:56,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391030965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:56,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:56,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:56,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700388295] [2025-03-03 10:44:56,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:56,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:56,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:56,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:56,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:56,431 INFO L87 Difference]: Start difference. First operand 34271 states and 43010 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 10:44:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:59,052 INFO L93 Difference]: Finished difference Result 92929 states and 117620 transitions. [2025-03-03 10:44:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 295 [2025-03-03 10:44:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:59,140 INFO L225 Difference]: With dead ends: 92929 [2025-03-03 10:44:59,140 INFO L226 Difference]: Without dead ends: 59447 [2025-03-03 10:44:59,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:44:59,164 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:59,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:44:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59447 states. [2025-03-03 10:44:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59447 to 57869. [2025-03-03 10:44:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57869 states, 57868 states have (on average 1.1960496301928527) internal successors, (69213), 57868 states have internal predecessors, (69213), 0 states have call successors, (0), 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 10:44:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57869 states to 57869 states and 69213 transitions. [2025-03-03 10:44:59,649 INFO L78 Accepts]: Start accepts. Automaton has 57869 states and 69213 transitions. Word has length 295 [2025-03-03 10:44:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:59,649 INFO L471 AbstractCegarLoop]: Abstraction has 57869 states and 69213 transitions. [2025-03-03 10:44:59,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 10:44:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 57869 states and 69213 transitions. [2025-03-03 10:44:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-03 10:44:59,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:59,654 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:59,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:44:59,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:59,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:59,655 INFO L85 PathProgramCache]: Analyzing trace with hash -959025393, now seen corresponding path program 1 times [2025-03-03 10:44:59,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:59,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930868007] [2025-03-03 10:44:59,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:59,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-03 10:44:59,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-03 10:44:59,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:59,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 10:44:59,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930868007] [2025-03-03 10:44:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930868007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:59,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:59,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947660782] [2025-03-03 10:44:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:59,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:59,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:59,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:59,833 INFO L87 Difference]: Start difference. First operand 57869 states and 69213 transitions. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 10:45:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:05,008 INFO L93 Difference]: Finished difference Result 156098 states and 188760 transitions. [2025-03-03 10:45:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 333 [2025-03-03 10:45:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:05,161 INFO L225 Difference]: With dead ends: 156098 [2025-03-03 10:45:05,162 INFO L226 Difference]: Without dead ends: 99018 [2025-03-03 10:45:05,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:05,191 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 1745 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6070 mSolverCounterSat, 1182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 7252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1182 IncrementalHoareTripleChecker+Valid, 6070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:05,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 709 Invalid, 7252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1182 Valid, 6070 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 10:45:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99018 states. [2025-03-03 10:45:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99018 to 98888. [2025-03-03 10:45:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98888 states, 98887 states have (on average 1.1899744152416394) internal successors, (117673), 98887 states have internal predecessors, (117673), 0 states have call successors, (0), 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 10:45:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98888 states to 98888 states and 117673 transitions. [2025-03-03 10:45:06,217 INFO L78 Accepts]: Start accepts. Automaton has 98888 states and 117673 transitions. Word has length 333 [2025-03-03 10:45:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:06,217 INFO L471 AbstractCegarLoop]: Abstraction has 98888 states and 117673 transitions. [2025-03-03 10:45:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 10:45:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 98888 states and 117673 transitions. [2025-03-03 10:45:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 10:45:06,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:06,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:06,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:45:06,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:06,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:06,222 INFO L85 PathProgramCache]: Analyzing trace with hash -704657811, now seen corresponding path program 1 times [2025-03-03 10:45:06,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:06,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753247932] [2025-03-03 10:45:06,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:06,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:06,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 10:45:06,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 10:45:06,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:06,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 10:45:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753247932] [2025-03-03 10:45:06,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753247932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:06,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:06,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639872559] [2025-03-03 10:45:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:06,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:06,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:06,646 INFO L87 Difference]: Start difference. First operand 98888 states and 117673 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:09,520 INFO L93 Difference]: Finished difference Result 230081 states and 272384 transitions. [2025-03-03 10:45:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-03-03 10:45:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:09,687 INFO L225 Difference]: With dead ends: 230081 [2025-03-03 10:45:09,687 INFO L226 Difference]: Without dead ends: 131982 [2025-03-03 10:45:09,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:09,739 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 752 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:09,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 2001 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:45:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131982 states. [2025-03-03 10:45:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131982 to 128796. [2025-03-03 10:45:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128796 states, 128795 states have (on average 1.1661011685236229) internal successors, (150188), 128795 states have internal predecessors, (150188), 0 states have call successors, (0), 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 10:45:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128796 states to 128796 states and 150188 transitions. [2025-03-03 10:45:11,323 INFO L78 Accepts]: Start accepts. Automaton has 128796 states and 150188 transitions. Word has length 348 [2025-03-03 10:45:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:11,323 INFO L471 AbstractCegarLoop]: Abstraction has 128796 states and 150188 transitions. [2025-03-03 10:45:11,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 128796 states and 150188 transitions. [2025-03-03 10:45:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-03-03 10:45:11,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:11,331 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:11,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:45:11,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:11,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1390167458, now seen corresponding path program 1 times [2025-03-03 10:45:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:11,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800513276] [2025-03-03 10:45:11,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:11,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-03 10:45:11,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-03 10:45:11,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:11,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 10:45:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800513276] [2025-03-03 10:45:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800513276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:11,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:11,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096610521] [2025-03-03 10:45:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:11,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:11,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:11,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:11,536 INFO L87 Difference]: Start difference. First operand 128796 states and 150188 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 10:45:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:14,744 INFO L93 Difference]: Finished difference Result 260711 states and 303370 transitions. [2025-03-03 10:45:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 382 [2025-03-03 10:45:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:14,889 INFO L225 Difference]: With dead ends: 260711 [2025-03-03 10:45:14,889 INFO L226 Difference]: Without dead ends: 128764 [2025-03-03 10:45:14,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:14,919 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 1036 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:14,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1651 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:45:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128764 states. [2025-03-03 10:45:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128764 to 120092. [2025-03-03 10:45:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120092 states, 120091 states have (on average 1.1145131608530199) internal successors, (133843), 120091 states have internal predecessors, (133843), 0 states have call successors, (0), 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 10:45:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120092 states to 120092 states and 133843 transitions. [2025-03-03 10:45:16,186 INFO L78 Accepts]: Start accepts. Automaton has 120092 states and 133843 transitions. Word has length 382 [2025-03-03 10:45:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:16,186 INFO L471 AbstractCegarLoop]: Abstraction has 120092 states and 133843 transitions. [2025-03-03 10:45:16,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 10:45:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 120092 states and 133843 transitions. [2025-03-03 10:45:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-03 10:45:16,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:16,195 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:16,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:45:16,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:16,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash 915368596, now seen corresponding path program 1 times [2025-03-03 10:45:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633808745] [2025-03-03 10:45:16,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:16,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:45:16,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:45:16,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:16,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 297 proven. 110 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 10:45:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633808745] [2025-03-03 10:45:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633808745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853998314] [2025-03-03 10:45:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:17,137 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 10:45:17,139 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 10:45:17,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:45:17,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:45:17,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:17,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:17,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:17,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-03 10:45:17,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853998314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:45:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907243073] [2025-03-03 10:45:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:17,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:17,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:17,400 INFO L87 Difference]: Start difference. First operand 120092 states and 133843 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 10:45:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:19,984 INFO L93 Difference]: Finished difference Result 237031 states and 264085 transitions. [2025-03-03 10:45:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 391 [2025-03-03 10:45:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:20,148 INFO L225 Difference]: With dead ends: 237031 [2025-03-03 10:45:20,148 INFO L226 Difference]: Without dead ends: 117728 [2025-03-03 10:45:20,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:20,230 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 1113 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:20,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1424 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:45:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117728 states. [2025-03-03 10:45:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117728 to 116936. [2025-03-03 10:45:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116936 states, 116935 states have (on average 1.0864155299952964) internal successors, (127040), 116935 states have internal predecessors, (127040), 0 states have call successors, (0), 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 10:45:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116936 states to 116936 states and 127040 transitions. [2025-03-03 10:45:21,564 INFO L78 Accepts]: Start accepts. Automaton has 116936 states and 127040 transitions. Word has length 391 [2025-03-03 10:45:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 116936 states and 127040 transitions. [2025-03-03 10:45:21,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 10:45:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 116936 states and 127040 transitions. [2025-03-03 10:45:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-03 10:45:21,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:21,571 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:21,578 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 10:45:21,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:45:21,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -87289436, now seen corresponding path program 1 times [2025-03-03 10:45:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015375728] [2025-03-03 10:45:21,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:21,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 10:45:21,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 10:45:21,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:21,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:45:22,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:22,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015375728] [2025-03-03 10:45:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015375728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:22,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:22,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:22,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350481896] [2025-03-03 10:45:22,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:22,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:22,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:22,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:22,099 INFO L87 Difference]: Start difference. First operand 116936 states and 127040 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 10:45:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:26,184 INFO L93 Difference]: Finished difference Result 283603 states and 309311 transitions. [2025-03-03 10:45:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:26,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 392 [2025-03-03 10:45:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:26,379 INFO L225 Difference]: With dead ends: 283603 [2025-03-03 10:45:26,379 INFO L226 Difference]: Without dead ends: 167456 [2025-03-03 10:45:26,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:26,441 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 953 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:26,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 679 Invalid, 3727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:45:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167456 states. [2025-03-03 10:45:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167456 to 164988. [2025-03-03 10:45:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164988 states, 164987 states have (on average 1.0917890500463674) internal successors, (180131), 164987 states have internal predecessors, (180131), 0 states have call successors, (0), 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 10:45:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164988 states to 164988 states and 180131 transitions. [2025-03-03 10:45:27,956 INFO L78 Accepts]: Start accepts. Automaton has 164988 states and 180131 transitions. Word has length 392 [2025-03-03 10:45:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:27,957 INFO L471 AbstractCegarLoop]: Abstraction has 164988 states and 180131 transitions. [2025-03-03 10:45:27,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 10:45:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 164988 states and 180131 transitions. [2025-03-03 10:45:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 10:45:27,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:27,964 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:27,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:45:27,965 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:27,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 976790225, now seen corresponding path program 1 times [2025-03-03 10:45:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629753180] [2025-03-03 10:45:27,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:27,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 10:45:28,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 10:45:28,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:28,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 429 proven. 113 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-03 10:45:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629753180] [2025-03-03 10:45:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629753180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824848526] [2025-03-03 10:45:29,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:29,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:29,318 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 10:45:29,318 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 10:45:29,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 10:45:29,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 10:45:29,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:29,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:29,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:45:29,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-03-03 10:45:29,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:29,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824848526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:29,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:29,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-03 10:45:29,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182764650] [2025-03-03 10:45:29,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:29,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:29,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:29,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:45:29,980 INFO L87 Difference]: Start difference. First operand 164988 states and 180131 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 10:45:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:32,574 INFO L93 Difference]: Finished difference Result 318962 states and 348741 transitions. [2025-03-03 10:45:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:32,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 459 [2025-03-03 10:45:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:32,752 INFO L225 Difference]: With dead ends: 318962 [2025-03-03 10:45:32,752 INFO L226 Difference]: Without dead ends: 170511 [2025-03-03 10:45:32,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:45:32,818 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 685 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:32,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1160 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:45:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170511 states. [2025-03-03 10:45:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170511 to 164990. [2025-03-03 10:45:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164990 states, 164989 states have (on average 1.0836661838061932) internal successors, (178793), 164989 states have internal predecessors, (178793), 0 states have call successors, (0), 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 10:45:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164990 states to 164990 states and 178793 transitions. [2025-03-03 10:45:34,498 INFO L78 Accepts]: Start accepts. Automaton has 164990 states and 178793 transitions. Word has length 459 [2025-03-03 10:45:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:34,499 INFO L471 AbstractCegarLoop]: Abstraction has 164990 states and 178793 transitions. [2025-03-03 10:45:34,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 10:45:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 164990 states and 178793 transitions. [2025-03-03 10:45:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 10:45:34,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:34,505 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:34,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:45:34,705 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,SelfDestructingSolverStorable11 [2025-03-03 10:45:34,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:34,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1328863228, now seen corresponding path program 1 times [2025-03-03 10:45:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109834883] [2025-03-03 10:45:34,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:34,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 10:45:34,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 10:45:34,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:34,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-03 10:45:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109834883] [2025-03-03 10:45:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109834883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577310540] [2025-03-03 10:45:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:34,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:34,879 INFO L87 Difference]: Start difference. First operand 164990 states and 178793 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 10:45:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:38,161 INFO L93 Difference]: Finished difference Result 374845 states and 408932 transitions. [2025-03-03 10:45:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:38,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 468 [2025-03-03 10:45:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:38,427 INFO L225 Difference]: With dead ends: 374845 [2025-03-03 10:45:38,427 INFO L226 Difference]: Without dead ends: 210644 [2025-03-03 10:45:38,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:38,509 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 945 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:38,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 719 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:45:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210644 states. [2025-03-03 10:45:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210644 to 209050. [2025-03-03 10:45:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209050 states, 209049 states have (on average 1.0862668560959392) internal successors, (227083), 209049 states have internal predecessors, (227083), 0 states have call successors, (0), 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 10:45:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209050 states to 209050 states and 227083 transitions. [2025-03-03 10:45:40,839 INFO L78 Accepts]: Start accepts. Automaton has 209050 states and 227083 transitions. Word has length 468 [2025-03-03 10:45:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:40,839 INFO L471 AbstractCegarLoop]: Abstraction has 209050 states and 227083 transitions. [2025-03-03 10:45:40,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 10:45:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 209050 states and 227083 transitions. [2025-03-03 10:45:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 10:45:40,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:40,848 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:40,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:45:40,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:40,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2136474947, now seen corresponding path program 1 times [2025-03-03 10:45:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935912066] [2025-03-03 10:45:40,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 10:45:41,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 10:45:41,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:41,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-03 10:45:41,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935912066] [2025-03-03 10:45:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935912066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:41,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:41,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195398043] [2025-03-03 10:45:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:41,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:41,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:41,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:41,405 INFO L87 Difference]: Start difference. First operand 209050 states and 227083 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 10:45:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:45,272 INFO L93 Difference]: Finished difference Result 427535 states and 465439 transitions. [2025-03-03 10:45:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 509 [2025-03-03 10:45:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:45,750 INFO L225 Difference]: With dead ends: 427535 [2025-03-03 10:45:45,750 INFO L226 Difference]: Without dead ends: 238955 [2025-03-03 10:45:45,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:45,821 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 835 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:45,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1643 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:45:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238955 states. [2025-03-03 10:45:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238955 to 232659. [2025-03-03 10:45:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232659 states, 232658 states have (on average 1.0824471971735337) internal successors, (251840), 232658 states have internal predecessors, (251840), 0 states have call successors, (0), 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 10:45:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232659 states to 232659 states and 251840 transitions. [2025-03-03 10:45:48,438 INFO L78 Accepts]: Start accepts. Automaton has 232659 states and 251840 transitions. Word has length 509 [2025-03-03 10:45:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:48,438 INFO L471 AbstractCegarLoop]: Abstraction has 232659 states and 251840 transitions. [2025-03-03 10:45:48,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 10:45:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 232659 states and 251840 transitions. [2025-03-03 10:45:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-03 10:45:48,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:48,449 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:48,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:45:48,450 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -121462782, now seen corresponding path program 1 times [2025-03-03 10:45:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660564738] [2025-03-03 10:45:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:48,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-03 10:45:48,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-03 10:45:48,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:48,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-03 10:45:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660564738] [2025-03-03 10:45:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660564738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:49,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:49,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107624065] [2025-03-03 10:45:49,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:49,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:49,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:49,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:49,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:49,008 INFO L87 Difference]: Start difference. First operand 232659 states and 251840 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)