./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem19_label19.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 497507965304fa3958b4d8590ba6d10980c500d31bff8080fc78d47954487eca --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:20:33,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:20:33,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:20:33,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:20:33,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:20:33,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:20:33,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:20:33,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:20:33,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:20:33,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:20:33,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:20:33,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:20:33,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:20:33,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:20:33,882 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:20:33,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:20:33,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:20:33,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:20:33,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:20:33,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:20:33,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:20:33,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:20:33,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:20:33,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:20:33,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:20:33,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:20:33,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:20:33,885 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 -> 497507965304fa3958b4d8590ba6d10980c500d31bff8080fc78d47954487eca [2025-03-08 02:20:34,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:20:34,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:20:34,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:20:34,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:20:34,157 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:20:34,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label19.c [2025-03-08 02:20:35,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000b71da7/67bc4788b2234ead9be16c3e7a7b9581/FLAG5ee3e21a5 [2025-03-08 02:20:35,902 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:20:35,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label19.c [2025-03-08 02:20:35,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000b71da7/67bc4788b2234ead9be16c3e7a7b9581/FLAG5ee3e21a5 [2025-03-08 02:20:36,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000b71da7/67bc4788b2234ead9be16c3e7a7b9581 [2025-03-08 02:20:36,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:20:36,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:20:36,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:20:36,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:20:36,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:20:36,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:20:36" (1/1) ... [2025-03-08 02:20:36,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357e2eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:36, skipping insertion in model container [2025-03-08 02:20:36,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:20:36" (1/1) ... [2025-03-08 02:20:36,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:20:36,730 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/Problem19_label19.c[3491,3504] [2025-03-08 02:20:37,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:20:37,527 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:20:37,540 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/Problem19_label19.c[3491,3504] [2025-03-08 02:20:37,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:20:37,980 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:20:37,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37 WrapperNode [2025-03-08 02:20:37,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:20:37,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:20:37,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:20:37,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:20:37,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:38,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:38,696 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:20:38,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:20:38,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:20:38,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:20:38,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:20:38,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:38,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:38,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,055 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-08 02:20:39,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:20:39,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:20:39,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:20:39,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:20:39,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (1/1) ... [2025-03-08 02:20:39,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:20:39,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:20:39,586 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-08 02:20:39,588 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-08 02:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:20:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:20:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:20:39,664 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:20:39,666 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:20:45,987 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:20:45,987 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:20:45,987 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:20:45,987 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:20:45,987 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:20:46,208 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:20:46,209 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:20:46,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:20:46,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:20:46,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:20:46 BoogieIcfgContainer [2025-03-08 02:20:46,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:20:46,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:20:46,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:20:46,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:20:46,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:20:36" (1/3) ... [2025-03-08 02:20:46,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404d40ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:20:46, skipping insertion in model container [2025-03-08 02:20:46,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:20:37" (2/3) ... [2025-03-08 02:20:46,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404d40ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:20:46, skipping insertion in model container [2025-03-08 02:20:46,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:20:46" (3/3) ... [2025-03-08 02:20:46,260 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label19.c [2025-03-08 02:20:46,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:20:46,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label19.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:20:46,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:20:46,371 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;@570e23fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:20:46,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:20:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 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-08 02:20:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 02:20:46,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:46,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:20:46,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:46,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash 336988771, now seen corresponding path program 1 times [2025-03-08 02:20:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494781883] [2025-03-08 02:20:46,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:46,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 02:20:46,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 02:20:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:46,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:46,611 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-08 02:20:46,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494781883] [2025-03-08 02:20:46,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494781883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:46,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:46,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:20:46,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923748336] [2025-03-08 02:20:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:46,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:20:46,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:46,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:20:46,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:46,639 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:52,284 INFO L93 Difference]: Finished difference Result 4975 states and 9413 transitions. [2025-03-08 02:20:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:20:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 02:20:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:52,313 INFO L225 Difference]: With dead ends: 4975 [2025-03-08 02:20:52,314 INFO L226 Difference]: Without dead ends: 3163 [2025-03-08 02:20:52,319 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-08 02:20:52,324 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1522 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4670 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 4670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:52,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1530 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 4670 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-08 02:20:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2025-03-08 02:20:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3123. [2025-03-08 02:20:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 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-08 02:20:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 5079 transitions. [2025-03-08 02:20:52,454 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 5079 transitions. Word has length 24 [2025-03-08 02:20:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:52,455 INFO L471 AbstractCegarLoop]: Abstraction has 3123 states and 5079 transitions. [2025-03-08 02:20:52,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:20:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 5079 transitions. [2025-03-08 02:20:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 02:20:52,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:52,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:20:52,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:20:52,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:52,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash -861935752, now seen corresponding path program 1 times [2025-03-08 02:20:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945615923] [2025-03-08 02:20:52,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:52,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 02:20:52,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 02:20:52,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:52,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:20:52,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945615923] [2025-03-08 02:20:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945615923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:52,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:52,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:52,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488529076] [2025-03-08 02:20:52,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:52,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:20:52,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:52,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:20:52,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:52,817 INFO L87 Difference]: Start difference. First operand 3123 states and 5079 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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-08 02:20:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:59,996 INFO L93 Difference]: Finished difference Result 10375 states and 16597 transitions. [2025-03-08 02:20:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:20:59,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2025-03-08 02:20:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:00,017 INFO L225 Difference]: With dead ends: 10375 [2025-03-08 02:21:00,017 INFO L226 Difference]: Without dead ends: 7254 [2025-03-08 02:21:00,022 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-08 02:21:00,023 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 4482 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 7002 mSolverCounterSat, 2736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 9738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2736 IncrementalHoareTripleChecker+Valid, 7002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:00,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 973 Invalid, 9738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2736 Valid, 7002 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-03-08 02:21:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2025-03-08 02:21:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 7248. [2025-03-08 02:21:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7247 states have (on average 1.4746791775907273) internal successors, (10687), 7247 states have internal predecessors, (10687), 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-08 02:21:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 10687 transitions. [2025-03-08 02:21:00,138 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 10687 transitions. Word has length 95 [2025-03-08 02:21:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:00,139 INFO L471 AbstractCegarLoop]: Abstraction has 7248 states and 10687 transitions. [2025-03-08 02:21:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 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-08 02:21:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 10687 transitions. [2025-03-08 02:21:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-08 02:21:00,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:00,148 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:00,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:21:00,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:00,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:00,149 INFO L85 PathProgramCache]: Analyzing trace with hash -433576909, now seen corresponding path program 1 times [2025-03-08 02:21:00,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:00,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117275199] [2025-03-08 02:21:00,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:00,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-08 02:21:00,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-08 02:21:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 02:21:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117275199] [2025-03-08 02:21:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117275199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:00,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:00,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314941807] [2025-03-08 02:21:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:00,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:00,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:00,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:00,954 INFO L87 Difference]: Start difference. First operand 7248 states and 10687 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 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-08 02:21:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:08,949 INFO L93 Difference]: Finished difference Result 20002 states and 31244 transitions. [2025-03-08 02:21:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 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 299 [2025-03-08 02:21:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:08,984 INFO L225 Difference]: With dead ends: 20002 [2025-03-08 02:21:08,984 INFO L226 Difference]: Without dead ends: 14121 [2025-03-08 02:21:08,991 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-08 02:21:08,991 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9438 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 10769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 9438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:08,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2155 Invalid, 10769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 9438 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2025-03-08 02:21:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14121 states. [2025-03-08 02:21:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14121 to 14105. [2025-03-08 02:21:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14105 states, 14104 states have (on average 1.2896341463414633) internal successors, (18189), 14104 states have internal predecessors, (18189), 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-08 02:21:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 18189 transitions. [2025-03-08 02:21:09,183 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 18189 transitions. Word has length 299 [2025-03-08 02:21:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:09,184 INFO L471 AbstractCegarLoop]: Abstraction has 14105 states and 18189 transitions. [2025-03-08 02:21:09,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 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-08 02:21:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 18189 transitions. [2025-03-08 02:21:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-08 02:21:09,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:09,188 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:09,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:21:09,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2065044421, now seen corresponding path program 1 times [2025-03-08 02:21:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394479885] [2025-03-08 02:21:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:09,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-08 02:21:09,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-08 02:21:09,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:09,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394479885] [2025-03-08 02:21:09,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394479885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:09,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:09,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:09,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116884754] [2025-03-08 02:21:09,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:09,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:09,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:09,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:09,740 INFO L87 Difference]: Start difference. First operand 14105 states and 18189 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 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-08 02:21:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:14,803 INFO L93 Difference]: Finished difference Result 25509 states and 33659 transitions. [2025-03-08 02:21:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 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 327 [2025-03-08 02:21:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:14,836 INFO L225 Difference]: With dead ends: 25509 [2025-03-08 02:21:14,837 INFO L226 Difference]: Without dead ends: 14105 [2025-03-08 02:21:14,845 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-08 02:21:14,845 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7317 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 7325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:14,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2113 Invalid, 7325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7317 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 02:21:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14105 states. [2025-03-08 02:21:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14105 to 14105. [2025-03-08 02:21:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14105 states, 14104 states have (on average 1.2887124220079411) internal successors, (18176), 14104 states have internal predecessors, (18176), 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-08 02:21:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 18176 transitions. [2025-03-08 02:21:15,007 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 18176 transitions. Word has length 327 [2025-03-08 02:21:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:15,007 INFO L471 AbstractCegarLoop]: Abstraction has 14105 states and 18176 transitions. [2025-03-08 02:21:15,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 3 states have internal predecessors, (327), 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-08 02:21:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 18176 transitions. [2025-03-08 02:21:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 02:21:15,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:15,015 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:15,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:21:15,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:15,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash -442075116, now seen corresponding path program 1 times [2025-03-08 02:21:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:15,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948480449] [2025-03-08 02:21:15,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:15,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 02:21:15,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 02:21:15,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:15,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 02:21:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948480449] [2025-03-08 02:21:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948480449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:15,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:15,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886099456] [2025-03-08 02:21:15,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:15,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:15,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:15,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:15,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:15,533 INFO L87 Difference]: Start difference. First operand 14105 states and 18176 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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-08 02:21:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:20,581 INFO L93 Difference]: Finished difference Result 36584 states and 48694 transitions. [2025-03-08 02:21:20,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:20,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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 579 [2025-03-08 02:21:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:20,625 INFO L225 Difference]: With dead ends: 36584 [2025-03-08 02:21:20,625 INFO L226 Difference]: Without dead ends: 25211 [2025-03-08 02:21:20,635 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-08 02:21:20,637 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 2111 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5117 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 5551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:20,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 987 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5117 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 02:21:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25211 states. [2025-03-08 02:21:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25211 to 25208. [2025-03-08 02:21:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25208 states, 25207 states have (on average 1.2881342484230571) internal successors, (32470), 25207 states have internal predecessors, (32470), 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-08 02:21:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25208 states to 25208 states and 32470 transitions. [2025-03-08 02:21:20,903 INFO L78 Accepts]: Start accepts. Automaton has 25208 states and 32470 transitions. Word has length 579 [2025-03-08 02:21:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:20,904 INFO L471 AbstractCegarLoop]: Abstraction has 25208 states and 32470 transitions. [2025-03-08 02:21:20,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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-08 02:21:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 25208 states and 32470 transitions. [2025-03-08 02:21:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-08 02:21:20,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:20,915 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:21:20,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:20,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 399939859, now seen corresponding path program 1 times [2025-03-08 02:21:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:20,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953818034] [2025-03-08 02:21:20,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:20,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-08 02:21:20,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-08 02:21:20,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:20,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 02:21:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953818034] [2025-03-08 02:21:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953818034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:21,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408303326] [2025-03-08 02:21:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:21,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:21,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:21,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:21,316 INFO L87 Difference]: Start difference. First operand 25208 states and 32470 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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-08 02:21:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:26,068 INFO L93 Difference]: Finished difference Result 53167 states and 70382 transitions. [2025-03-08 02:21:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:26,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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 596 [2025-03-08 02:21:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:26,145 INFO L225 Difference]: With dead ends: 53167 [2025-03-08 02:21:26,145 INFO L226 Difference]: Without dead ends: 30691 [2025-03-08 02:21:26,161 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-08 02:21:26,163 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1387 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 2136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 6061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2136 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:26,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 752 Invalid, 6061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2136 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 02:21:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30691 states. [2025-03-08 02:21:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30691 to 30678. [2025-03-08 02:21:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30678 states, 30677 states have (on average 1.2795253773185122) internal successors, (39252), 30677 states have internal predecessors, (39252), 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-08 02:21:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30678 states to 30678 states and 39252 transitions. [2025-03-08 02:21:26,557 INFO L78 Accepts]: Start accepts. Automaton has 30678 states and 39252 transitions. Word has length 596 [2025-03-08 02:21:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:26,558 INFO L471 AbstractCegarLoop]: Abstraction has 30678 states and 39252 transitions. [2025-03-08 02:21:26,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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-08 02:21:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 30678 states and 39252 transitions. [2025-03-08 02:21:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2025-03-08 02:21:26,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:26,567 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:26,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:21:26,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:26,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1923525455, now seen corresponding path program 1 times [2025-03-08 02:21:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971633807] [2025-03-08 02:21:26,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:26,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:26,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-08 02:21:26,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-08 02:21:26,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:26,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-08 02:21:26,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:26,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971633807] [2025-03-08 02:21:26,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971633807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:26,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:26,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916050910] [2025-03-08 02:21:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:26,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:26,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:26,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:26,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:26,878 INFO L87 Difference]: Start difference. First operand 30678 states and 39252 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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-08 02:21:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:32,059 INFO L93 Difference]: Finished difference Result 84784 states and 110331 transitions. [2025-03-08 02:21:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:32,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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 634 [2025-03-08 02:21:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:32,174 INFO L225 Difference]: With dead ends: 84784 [2025-03-08 02:21:32,174 INFO L226 Difference]: Without dead ends: 56838 [2025-03-08 02:21:32,199 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-08 02:21:32,206 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 1350 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 4297 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 5727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:32,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2061 Invalid, 5727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4297 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 02:21:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56838 states. [2025-03-08 02:21:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56838 to 54084. [2025-03-08 02:21:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54084 states, 54083 states have (on average 1.192297024943143) internal successors, (64483), 54083 states have internal predecessors, (64483), 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-08 02:21:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54084 states to 54084 states and 64483 transitions. [2025-03-08 02:21:32,841 INFO L78 Accepts]: Start accepts. Automaton has 54084 states and 64483 transitions. Word has length 634 [2025-03-08 02:21:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:32,841 INFO L471 AbstractCegarLoop]: Abstraction has 54084 states and 64483 transitions. [2025-03-08 02:21:32,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 2 states have internal predecessors, (513), 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-08 02:21:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 54084 states and 64483 transitions. [2025-03-08 02:21:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2025-03-08 02:21:32,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:32,846 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:32,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:21:32,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:32,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash -150004958, now seen corresponding path program 1 times [2025-03-08 02:21:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:32,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824660941] [2025-03-08 02:21:32,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:32,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:32,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 808 statements into 1 equivalence classes. [2025-03-08 02:21:32,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 808 of 808 statements. [2025-03-08 02:21:32,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:32,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 02:21:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824660941] [2025-03-08 02:21:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824660941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:21:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785928417] [2025-03-08 02:21:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:33,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:33,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:33,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:33,369 INFO L87 Difference]: Start difference. First operand 54084 states and 64483 transitions. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 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-08 02:21:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:41,667 INFO L93 Difference]: Finished difference Result 179367 states and 218761 transitions. [2025-03-08 02:21:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 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 808 [2025-03-08 02:21:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:41,839 INFO L225 Difference]: With dead ends: 179367 [2025-03-08 02:21:41,839 INFO L226 Difference]: Without dead ends: 128015 [2025-03-08 02:21:41,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 02:21:41,879 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 3336 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8739 mSolverCounterSat, 3143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 11882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3143 IncrementalHoareTripleChecker+Valid, 8739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:41,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 1111 Invalid, 11882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3143 Valid, 8739 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-03-08 02:21:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128015 states. [2025-03-08 02:21:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128015 to 127891. [2025-03-08 02:21:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127891 states, 127890 states have (on average 1.1647275001954804) internal successors, (148957), 127890 states have internal predecessors, (148957), 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-08 02:21:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127891 states to 127891 states and 148957 transitions. [2025-03-08 02:21:43,317 INFO L78 Accepts]: Start accepts. Automaton has 127891 states and 148957 transitions. Word has length 808 [2025-03-08 02:21:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:43,319 INFO L471 AbstractCegarLoop]: Abstraction has 127891 states and 148957 transitions. [2025-03-08 02:21:43,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 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-08 02:21:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 127891 states and 148957 transitions. [2025-03-08 02:21:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-08 02:21:43,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:43,328 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:43,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:21:43,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:43,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash 573077606, now seen corresponding path program 1 times [2025-03-08 02:21:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:43,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768611750] [2025-03-08 02:21:43,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:43,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 826 statements into 1 equivalence classes. [2025-03-08 02:21:43,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 826 of 826 statements. [2025-03-08 02:21:43,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:43,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 150 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:45,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:45,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768611750] [2025-03-08 02:21:45,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768611750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:21:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647278978] [2025-03-08 02:21:45,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:45,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:21:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:21:45,604 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-08 02:21:45,606 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-08 02:21:45,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 826 statements into 1 equivalence classes. [2025-03-08 02:21:45,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 826 of 826 statements. [2025-03-08 02:21:45,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:45,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:45,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:21:45,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:21:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 02:21:46,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:21:46,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647278978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:21:46,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 02:21:46,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158568093] [2025-03-08 02:21:46,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:46,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:46,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:46,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:21:46,103 INFO L87 Difference]: Start difference. First operand 127891 states and 148957 transitions. Second operand has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 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-08 02:21:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:51,627 INFO L93 Difference]: Finished difference Result 294124 states and 349030 transitions. [2025-03-08 02:21:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:51,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 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 826 [2025-03-08 02:21:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:51,853 INFO L225 Difference]: With dead ends: 294124 [2025-03-08 02:21:51,854 INFO L226 Difference]: Without dead ends: 168965 [2025-03-08 02:21:51,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 827 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:21:51,939 INFO L435 NwaCegarLoop]: 3092 mSDtfsCounter, 1265 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 4177 mSolverCounterSat, 1624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 5801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1624 IncrementalHoareTripleChecker+Valid, 4177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:51,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 3266 Invalid, 5801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1624 Valid, 4177 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 02:21:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168965 states. [2025-03-08 02:21:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168965 to 168862. [2025-03-08 02:21:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168862 states, 168861 states have (on average 1.1571529245947851) internal successors, (195398), 168861 states have internal predecessors, (195398), 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-08 02:21:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168862 states to 168862 states and 195398 transitions. [2025-03-08 02:21:54,177 INFO L78 Accepts]: Start accepts. Automaton has 168862 states and 195398 transitions. Word has length 826 [2025-03-08 02:21:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 168862 states and 195398 transitions. [2025-03-08 02:21:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 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-08 02:21:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 168862 states and 195398 transitions. [2025-03-08 02:21:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2025-03-08 02:21:54,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:54,187 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:21:54,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:21:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:21:54,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash 999111130, now seen corresponding path program 1 times [2025-03-08 02:21:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405349231] [2025-03-08 02:21:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:54,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1007 statements into 1 equivalence classes. [2025-03-08 02:21:54,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1007 of 1007 statements. [2025-03-08 02:21:54,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:54,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-08 02:21:55,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:55,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405349231] [2025-03-08 02:21:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405349231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:55,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:55,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:21:55,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061338689] [2025-03-08 02:21:55,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:55,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:55,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:55,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:55,097 INFO L87 Difference]: Start difference. First operand 168862 states and 195398 transitions. Second operand has 4 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 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)