./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label55.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5c92878d09fe8ca31ff62e1863ecb09ce1afff2124636cc8090fb7804c754eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:21:53,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:21:53,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:21:53,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:21:53,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:21:53,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:21:53,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:21:53,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:21:53,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:21:53,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:21:53,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:21:53,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:21:53,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:21:53,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:21:53,459 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:21:53,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:21:53,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:21:53,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:21:53,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:21:53,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:21:53,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:21:53,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:21:53,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:21:53,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:21:53,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:21:53,462 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5c92878d09fe8ca31ff62e1863ecb09ce1afff2124636cc8090fb7804c754eb [2025-01-09 00:21:53,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:21:53,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:21:53,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:21:53,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:21:53,698 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:21:53,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label55.c [2025-01-09 00:21:54,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8388fcabd/f252d3b24d954bee9064d7f0d1a24149/FLAG8dc412484 [2025-01-09 00:21:55,142 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:21:55,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label55.c [2025-01-09 00:21:55,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8388fcabd/f252d3b24d954bee9064d7f0d1a24149/FLAG8dc412484 [2025-01-09 00:21:55,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8388fcabd/f252d3b24d954bee9064d7f0d1a24149 [2025-01-09 00:21:55,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:21:55,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:21:55,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:21:55,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:21:55,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:21:55,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:21:55" (1/1) ... [2025-01-09 00:21:55,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1747c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:55, skipping insertion in model container [2025-01-09 00:21:55,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:21:55" (1/1) ... [2025-01-09 00:21:55,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:21:55,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label55.c[1618,1631] [2025-01-09 00:21:55,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:21:55,997 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:21:56,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label55.c[1618,1631] [2025-01-09 00:21:56,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:21:56,192 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:21:56,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56 WrapperNode [2025-01-09 00:21:56,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:21:56,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:21:56,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:21:56,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:21:56,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,393 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:21:56,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:21:56,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:21:56,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:21:56,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:21:56,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,512 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:21:56,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:21:56,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:21:56,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:21:56,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:21:56,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (1/1) ... [2025-01-09 00:21:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:21:56,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:21:56,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:21:56,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:21:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:21:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:21:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:21:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:21:56,751 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:21:56,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:21:59,390 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:21:59,391 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:21:59,421 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:21:59,421 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:21:59,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:21:59 BoogieIcfgContainer [2025-01-09 00:21:59,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:21:59,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:21:59,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:21:59,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:21:59,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:21:55" (1/3) ... [2025-01-09 00:21:59,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e38df67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:21:59, skipping insertion in model container [2025-01-09 00:21:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:21:56" (2/3) ... [2025-01-09 00:21:59,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e38df67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:21:59, skipping insertion in model container [2025-01-09 00:21:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:21:59" (3/3) ... [2025-01-09 00:21:59,432 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label55.c [2025-01-09 00:21:59,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:21:59,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label55.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:21:59,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:21:59,516 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;@20e84339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:21:59,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:21:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:21:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 00:21:59,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:21:59,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:21:59,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:21:59,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:21:59,529 INFO L85 PathProgramCache]: Analyzing trace with hash 446251106, now seen corresponding path program 1 times [2025-01-09 00:21:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:21:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67025096] [2025-01-09 00:21:59,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:21:59,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:21:59,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 00:21:59,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 00:21:59,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:21:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:21:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:21:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:21:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67025096] [2025-01-09 00:21:59,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67025096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:21:59,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:21:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:21:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463079658] [2025-01-09 00:21:59,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:21:59,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:21:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:21:59,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:21:59,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:21:59,737 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:02,261 INFO L93 Difference]: Finished difference Result 2205 states and 4263 transitions. [2025-01-09 00:22:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:02,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-01-09 00:22:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:02,278 INFO L225 Difference]: With dead ends: 2205 [2025-01-09 00:22:02,278 INFO L226 Difference]: Without dead ends: 1384 [2025-01-09 00:22:02,282 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-01-09 00:22:02,284 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 707 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:02,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 430 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:22:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-01-09 00:22:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-01-09 00:22:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2284 transitions. [2025-01-09 00:22:02,365 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2284 transitions. Word has length 12 [2025-01-09 00:22:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:02,365 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2284 transitions. [2025-01-09 00:22:02,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions. [2025-01-09 00:22:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 00:22:02,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:02,368 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:22:02,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:22:02,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:02,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2025255541, now seen corresponding path program 1 times [2025-01-09 00:22:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:02,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600992743] [2025-01-09 00:22:02,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:02,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:02,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 00:22:02,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 00:22:02,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:02,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:22:02,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:02,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600992743] [2025-01-09 00:22:02,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600992743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:02,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:02,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:22:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179850142] [2025-01-09 00:22:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:02,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:02,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:02,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:02,559 INFO L87 Difference]: Start difference. First operand 1384 states and 2284 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:04,758 INFO L93 Difference]: Finished difference Result 4146 states and 6847 transitions. [2025-01-09 00:22:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:04,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-01-09 00:22:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:04,768 INFO L225 Difference]: With dead ends: 4146 [2025-01-09 00:22:04,769 INFO L226 Difference]: Without dead ends: 2764 [2025-01-09 00:22:04,771 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-01-09 00:22:04,772 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:04,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 531 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:22:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-01-09 00:22:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-01-09 00:22:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3881 transitions. [2025-01-09 00:22:04,837 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3881 transitions. Word has length 78 [2025-01-09 00:22:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:04,838 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3881 transitions. [2025-01-09 00:22:04,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions. [2025-01-09 00:22:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 00:22:04,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:04,841 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:22:04,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:22:04,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:04,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1509277480, now seen corresponding path program 1 times [2025-01-09 00:22:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414756271] [2025-01-09 00:22:04,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:04,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 00:22:04,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 00:22:04,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:04,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:22:04,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414756271] [2025-01-09 00:22:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414756271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:22:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532827516] [2025-01-09 00:22:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:04,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:04,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:04,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:04,987 INFO L87 Difference]: Start difference. First operand 2764 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:06,887 INFO L93 Difference]: Finished difference Result 8286 states and 11638 transitions. [2025-01-09 00:22:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:06,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-09 00:22:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:06,905 INFO L225 Difference]: With dead ends: 8286 [2025-01-09 00:22:06,905 INFO L226 Difference]: Without dead ends: 5524 [2025-01-09 00:22:06,908 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-01-09 00:22:06,911 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 707 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:06,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 435 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:22:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2025-01-09 00:22:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 4834. [2025-01-09 00:22:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4834 states, 4833 states have (on average 1.2971239395820402) internal successors, (6269), 4833 states have internal predecessors, (6269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 6269 transitions. [2025-01-09 00:22:06,985 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 6269 transitions. Word has length 79 [2025-01-09 00:22:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:06,986 INFO L471 AbstractCegarLoop]: Abstraction has 4834 states and 6269 transitions. [2025-01-09 00:22:06,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 6269 transitions. [2025-01-09 00:22:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 00:22:06,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:06,994 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:06,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:22:06,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 611263612, now seen corresponding path program 1 times [2025-01-09 00:22:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122045127] [2025-01-09 00:22:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:07,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 00:22:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 00:22:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 00:22:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122045127] [2025-01-09 00:22:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122045127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:07,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764414496] [2025-01-09 00:22:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:07,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:07,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:07,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:07,485 INFO L87 Difference]: Start difference. First operand 4834 states and 6269 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:10,173 INFO L93 Difference]: Finished difference Result 12426 states and 15644 transitions. [2025-01-09 00:22:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:22:10,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-01-09 00:22:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:10,199 INFO L225 Difference]: With dead ends: 12426 [2025-01-09 00:22:10,199 INFO L226 Difference]: Without dead ends: 7594 [2025-01-09 00:22:10,206 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-01-09 00:22:10,207 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:10,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:22:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2025-01-09 00:22:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904. [2025-01-09 00:22:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.2358394900767782) internal successors, (8531), 6903 states have internal predecessors, (8531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8531 transitions. [2025-01-09 00:22:10,347 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8531 transitions. Word has length 199 [2025-01-09 00:22:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:10,348 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8531 transitions. [2025-01-09 00:22:10,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8531 transitions. [2025-01-09 00:22:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-09 00:22:10,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:10,351 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:22:10,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:22:10,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1343347477, now seen corresponding path program 1 times [2025-01-09 00:22:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196127626] [2025-01-09 00:22:10,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:10,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 00:22:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 00:22:10,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:10,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 00:22:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196127626] [2025-01-09 00:22:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196127626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:10,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476336702] [2025-01-09 00:22:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:10,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:10,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:10,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:10,731 INFO L87 Difference]: Start difference. First operand 6904 states and 8531 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:12,575 INFO L93 Difference]: Finished difference Result 15239 states and 18535 transitions. [2025-01-09 00:22:12,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:22:12,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 381 [2025-01-09 00:22:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:12,595 INFO L225 Difference]: With dead ends: 15239 [2025-01-09 00:22:12,595 INFO L226 Difference]: Without dead ends: 8284 [2025-01-09 00:22:12,601 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-01-09 00:22:12,602 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 513 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:12,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 640 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:22:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2025-01-09 00:22:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2025-01-09 00:22:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.154291923216226) internal successors, (9561), 8283 states have internal predecessors, (9561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9561 transitions. [2025-01-09 00:22:12,705 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9561 transitions. Word has length 381 [2025-01-09 00:22:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:12,705 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9561 transitions. [2025-01-09 00:22:12,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9561 transitions. [2025-01-09 00:22:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-09 00:22:12,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:12,709 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:22:12,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:12,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1038456378, now seen corresponding path program 1 times [2025-01-09 00:22:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:12,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489034630] [2025-01-09 00:22:12,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:12,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-09 00:22:12,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-09 00:22:12,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:12,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 00:22:12,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:12,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489034630] [2025-01-09 00:22:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489034630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:12,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:22:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508962617] [2025-01-09 00:22:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:12,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:12,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:12,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:12,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:12,992 INFO L87 Difference]: Start difference. First operand 8284 states and 9561 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:14,667 INFO L93 Difference]: Finished difference Result 20016 states and 22949 transitions. [2025-01-09 00:22:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:14,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 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 396 [2025-01-09 00:22:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:14,686 INFO L225 Difference]: With dead ends: 20016 [2025-01-09 00:22:14,687 INFO L226 Difference]: Without dead ends: 11734 [2025-01-09 00:22:14,694 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-01-09 00:22:14,694 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:14,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:22:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2025-01-09 00:22:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11734. [2025-01-09 00:22:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.119151112247507) internal successors, (13131), 11733 states have internal predecessors, (13131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13131 transitions. [2025-01-09 00:22:14,810 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13131 transitions. Word has length 396 [2025-01-09 00:22:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:14,810 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13131 transitions. [2025-01-09 00:22:14,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13131 transitions. [2025-01-09 00:22:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-01-09 00:22:14,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:14,820 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:14,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:22:14,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:14,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1674102362, now seen corresponding path program 1 times [2025-01-09 00:22:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057256655] [2025-01-09 00:22:14,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:14,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 00:22:14,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 00:22:14,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:14,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:22:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:15,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057256655] [2025-01-09 00:22:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057256655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728784347] [2025-01-09 00:22:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:15,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:15,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:15,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:15,273 INFO L87 Difference]: Start difference. First operand 11734 states and 13131 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:16,799 INFO L93 Difference]: Finished difference Result 32436 states and 36566 transitions. [2025-01-09 00:22:16,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 404 [2025-01-09 00:22:16,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:16,831 INFO L225 Difference]: With dead ends: 32436 [2025-01-09 00:22:16,832 INFO L226 Difference]: Without dead ends: 20704 [2025-01-09 00:22:16,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:16,845 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 600 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:16,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 979 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:22:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-01-09 00:22:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20014. [2025-01-09 00:22:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.095537900364763) internal successors, (21925), 20013 states have internal predecessors, (21925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 21925 transitions. [2025-01-09 00:22:17,068 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 21925 transitions. Word has length 404 [2025-01-09 00:22:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:17,068 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 21925 transitions. [2025-01-09 00:22:17,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 21925 transitions. [2025-01-09 00:22:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-01-09 00:22:17,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:17,074 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:17,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:22:17,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:17,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1604627732, now seen corresponding path program 1 times [2025-01-09 00:22:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:17,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068693014] [2025-01-09 00:22:17,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:17,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 00:22:17,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 00:22:17,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:17,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 00:22:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:17,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068693014] [2025-01-09 00:22:17,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068693014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:17,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039756742] [2025-01-09 00:22:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:17,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:17,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:17,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:17,280 INFO L87 Difference]: Start difference. First operand 20014 states and 21925 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:18,885 INFO L93 Difference]: Finished difference Result 46236 states and 50984 transitions. [2025-01-09 00:22:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:18,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 411 [2025-01-09 00:22:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:18,919 INFO L225 Difference]: With dead ends: 46236 [2025-01-09 00:22:18,919 INFO L226 Difference]: Without dead ends: 22774 [2025-01-09 00:22:18,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:18,933 INFO L435 NwaCegarLoop]: 1113 mSDtfsCounter, 692 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:18,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1120 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:22:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22774 states. [2025-01-09 00:22:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22774 to 20704. [2025-01-09 00:22:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.0554025986571995) internal successors, (21850), 20703 states have internal predecessors, (21850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 21850 transitions. [2025-01-09 00:22:19,104 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 21850 transitions. Word has length 411 [2025-01-09 00:22:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:19,105 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 21850 transitions. [2025-01-09 00:22:19,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 21850 transitions. [2025-01-09 00:22:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-01-09 00:22:19,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:19,112 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:22:19,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:22:19,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:19,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash 439690083, now seen corresponding path program 1 times [2025-01-09 00:22:19,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110648193] [2025-01-09 00:22:19,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:19,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:19,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-09 00:22:19,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-09 00:22:19,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:19,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-01-09 00:22:19,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110648193] [2025-01-09 00:22:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110648193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:19,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817452585] [2025-01-09 00:22:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:19,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:19,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:19,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:19,337 INFO L87 Difference]: Start difference. First operand 20704 states and 21850 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:20,786 INFO L93 Difference]: Finished difference Result 46236 states and 49051 transitions. [2025-01-09 00:22:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 482 [2025-01-09 00:22:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:20,818 INFO L225 Difference]: With dead ends: 46236 [2025-01-09 00:22:20,818 INFO L226 Difference]: Without dead ends: 23464 [2025-01-09 00:22:20,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:20,834 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 698 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:20,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 936 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:22:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23464 states. [2025-01-09 00:22:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 23464. [2025-01-09 00:22:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23464 states, 23463 states have (on average 1.0528065464774325) internal successors, (24702), 23463 states have internal predecessors, (24702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 24702 transitions. [2025-01-09 00:22:21,023 INFO L78 Accepts]: Start accepts. Automaton has 23464 states and 24702 transitions. Word has length 482 [2025-01-09 00:22:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:21,024 INFO L471 AbstractCegarLoop]: Abstraction has 23464 states and 24702 transitions. [2025-01-09 00:22:21,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23464 states and 24702 transitions. [2025-01-09 00:22:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-01-09 00:22:21,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:21,032 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-01-09 00:22:21,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:22:21,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:21,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash 265318780, now seen corresponding path program 1 times [2025-01-09 00:22:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:21,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305171246] [2025-01-09 00:22:21,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:21,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-01-09 00:22:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-01-09 00:22:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-01-09 00:22:21,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:21,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305171246] [2025-01-09 00:22:21,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305171246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:21,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:21,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538207577] [2025-01-09 00:22:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:21,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:21,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:21,748 INFO L87 Difference]: Start difference. First operand 23464 states and 24702 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:22,973 INFO L93 Difference]: Finished difference Result 46926 states and 49402 transitions. [2025-01-09 00:22:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:22,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 645 [2025-01-09 00:22:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:22,997 INFO L225 Difference]: With dead ends: 46926 [2025-01-09 00:22:22,997 INFO L226 Difference]: Without dead ends: 23464 [2025-01-09 00:22:23,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-01-09 00:22:23,010 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 785 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:23,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 746 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:22:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23464 states. [2025-01-09 00:22:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 23464. [2025-01-09 00:22:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23464 states, 23463 states have (on average 1.046583983292844) internal successors, (24556), 23463 states have internal predecessors, (24556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 24556 transitions. [2025-01-09 00:22:23,177 INFO L78 Accepts]: Start accepts. Automaton has 23464 states and 24556 transitions. Word has length 645 [2025-01-09 00:22:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:23,178 INFO L471 AbstractCegarLoop]: Abstraction has 23464 states and 24556 transitions. [2025-01-09 00:22:23,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23464 states and 24556 transitions. [2025-01-09 00:22:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-01-09 00:22:23,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:23,185 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:23,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:22:23,186 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:23,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash -23285052, now seen corresponding path program 1 times [2025-01-09 00:22:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923653944] [2025-01-09 00:22:23,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:23,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 00:22:23,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 00:22:23,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:23,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-01-09 00:22:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923653944] [2025-01-09 00:22:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923653944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104702803] [2025-01-09 00:22:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:23,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:23,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:23,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:23,412 INFO L87 Difference]: Start difference. First operand 23464 states and 24556 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:24,825 INFO L93 Difference]: Finished difference Result 53136 states and 55835 transitions. [2025-01-09 00:22:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:24,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 688 [2025-01-09 00:22:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:24,859 INFO L225 Difference]: With dead ends: 53136 [2025-01-09 00:22:24,860 INFO L226 Difference]: Without dead ends: 29674 [2025-01-09 00:22:24,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:24,879 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 686 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:24,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 261 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:22:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29674 states. [2025-01-09 00:22:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29674 to 23464. [2025-01-09 00:22:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23464 states, 23463 states have (on average 1.046583983292844) internal successors, (24556), 23463 states have internal predecessors, (24556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 24556 transitions. [2025-01-09 00:22:25,093 INFO L78 Accepts]: Start accepts. Automaton has 23464 states and 24556 transitions. Word has length 688 [2025-01-09 00:22:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:25,094 INFO L471 AbstractCegarLoop]: Abstraction has 23464 states and 24556 transitions. [2025-01-09 00:22:25,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 23464 states and 24556 transitions. [2025-01-09 00:22:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-01-09 00:22:25,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:25,102 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:25,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:22:25,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:25,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1626449984, now seen corresponding path program 1 times [2025-01-09 00:22:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245064361] [2025-01-09 00:22:25,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:25,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-01-09 00:22:25,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-01-09 00:22:25,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:25,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 791 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 00:22:25,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:25,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245064361] [2025-01-09 00:22:25,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245064361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:25,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:25,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:25,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139749054] [2025-01-09 00:22:25,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:25,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:25,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:25,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:25,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:25,443 INFO L87 Difference]: Start difference. First operand 23464 states and 24556 transitions. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:26,831 INFO L93 Difference]: Finished difference Result 55206 states and 58032 transitions. [2025-01-09 00:22:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:26,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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 712 [2025-01-09 00:22:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:26,861 INFO L225 Difference]: With dead ends: 55206 [2025-01-09 00:22:26,862 INFO L226 Difference]: Without dead ends: 31744 [2025-01-09 00:22:26,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:26,879 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 570 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:26,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 978 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:22:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31744 states. [2025-01-09 00:22:27,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31744 to 31744. [2025-01-09 00:22:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31744 states, 31743 states have (on average 1.0439151939010176) internal successors, (33137), 31743 states have internal predecessors, (33137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 33137 transitions. [2025-01-09 00:22:27,094 INFO L78 Accepts]: Start accepts. Automaton has 31744 states and 33137 transitions. Word has length 712 [2025-01-09 00:22:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:27,094 INFO L471 AbstractCegarLoop]: Abstraction has 31744 states and 33137 transitions. [2025-01-09 00:22:27,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 31744 states and 33137 transitions. [2025-01-09 00:22:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-01-09 00:22:27,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:27,103 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 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] [2025-01-09 00:22:27,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:22:27,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1057954793, now seen corresponding path program 1 times [2025-01-09 00:22:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987189339] [2025-01-09 00:22:27,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:27,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-01-09 00:22:27,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-01-09 00:22:27,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:27,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-01-09 00:22:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987189339] [2025-01-09 00:22:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987189339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798181614] [2025-01-09 00:22:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:27,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:27,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:27,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:27,545 INFO L87 Difference]: Start difference. First operand 31744 states and 33137 transitions. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:28,873 INFO L93 Difference]: Finished difference Result 71076 states and 74482 transitions. [2025-01-09 00:22:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:28,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 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 740 [2025-01-09 00:22:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:28,905 INFO L225 Difference]: With dead ends: 71076 [2025-01-09 00:22:28,905 INFO L226 Difference]: Without dead ends: 39334 [2025-01-09 00:22:28,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:28,925 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 587 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:28,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 260 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:22:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39334 states. [2025-01-09 00:22:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 39334. [2025-01-09 00:22:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39334 states, 39333 states have (on average 1.0418732362138663) internal successors, (40980), 39333 states have internal predecessors, (40980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39334 states to 39334 states and 40980 transitions. [2025-01-09 00:22:29,246 INFO L78 Accepts]: Start accepts. Automaton has 39334 states and 40980 transitions. Word has length 740 [2025-01-09 00:22:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:29,246 INFO L471 AbstractCegarLoop]: Abstraction has 39334 states and 40980 transitions. [2025-01-09 00:22:29,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 39334 states and 40980 transitions. [2025-01-09 00:22:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2025-01-09 00:22:29,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:29,259 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:22:29,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:22:29,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 503681742, now seen corresponding path program 1 times [2025-01-09 00:22:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701083265] [2025-01-09 00:22:29,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:29,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-01-09 00:22:29,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-01-09 00:22:29,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:29,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 1272 proven. 614 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-01-09 00:22:30,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701083265] [2025-01-09 00:22:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701083265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:22:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202049752] [2025-01-09 00:22:30,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:30,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:22:30,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:22:30,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:22:30,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:22:30,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-01-09 00:22:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-01-09 00:22:31,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:31,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:31,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:22:31,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:22:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2057 backedges. 1284 proven. 0 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2025-01-09 00:22:31,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:22:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202049752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:31,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:22:31,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:22:31,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553906150] [2025-01-09 00:22:31,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:31,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:31,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:31,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:22:31,286 INFO L87 Difference]: Start difference. First operand 39334 states and 40980 transitions. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:32,624 INFO L93 Difference]: Finished difference Result 92466 states and 96740 transitions. [2025-01-09 00:22:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:32,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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 1276 [2025-01-09 00:22:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:32,680 INFO L225 Difference]: With dead ends: 92466 [2025-01-09 00:22:32,681 INFO L226 Difference]: Without dead ends: 53824 [2025-01-09 00:22:32,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1282 GetRequests, 1276 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:22:32,709 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 639 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:32,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 137 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:22:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53824 states. [2025-01-09 00:22:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53824 to 53134. [2025-01-09 00:22:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53134 states, 53133 states have (on average 1.039203508177592) internal successors, (55216), 53133 states have internal predecessors, (55216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53134 states to 53134 states and 55216 transitions. [2025-01-09 00:22:33,163 INFO L78 Accepts]: Start accepts. Automaton has 53134 states and 55216 transitions. Word has length 1276 [2025-01-09 00:22:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:33,164 INFO L471 AbstractCegarLoop]: Abstraction has 53134 states and 55216 transitions. [2025-01-09 00:22:33,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 53134 states and 55216 transitions. [2025-01-09 00:22:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1444 [2025-01-09 00:22:33,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:33,189 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:22:33,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:22:33,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 00:22:33,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:33,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash -947937417, now seen corresponding path program 1 times [2025-01-09 00:22:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:33,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901098887] [2025-01-09 00:22:33,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:33,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1443 statements into 1 equivalence classes. [2025-01-09 00:22:33,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1443 of 1443 statements. [2025-01-09 00:22:33,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3257 backedges. 1996 proven. 0 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2025-01-09 00:22:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901098887] [2025-01-09 00:22:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901098887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:33,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:33,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:33,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704438661] [2025-01-09 00:22:33,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:33,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:33,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:33,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:33,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:33,944 INFO L87 Difference]: Start difference. First operand 53134 states and 55216 transitions. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:35,239 INFO L93 Difference]: Finished difference Result 105576 states and 109739 transitions. [2025-01-09 00:22:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:35,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 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 1443 [2025-01-09 00:22:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:35,293 INFO L225 Difference]: With dead ends: 105576 [2025-01-09 00:22:35,293 INFO L226 Difference]: Without dead ends: 53134 [2025-01-09 00:22:35,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:35,323 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 587 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:35,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 942 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:22:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53134 states. [2025-01-09 00:22:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 53134. [2025-01-09 00:22:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53134 states, 53133 states have (on average 1.0375661076920182) internal successors, (55129), 53133 states have internal predecessors, (55129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53134 states to 53134 states and 55129 transitions. [2025-01-09 00:22:35,728 INFO L78 Accepts]: Start accepts. Automaton has 53134 states and 55129 transitions. Word has length 1443 [2025-01-09 00:22:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:35,729 INFO L471 AbstractCegarLoop]: Abstraction has 53134 states and 55129 transitions. [2025-01-09 00:22:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 53134 states and 55129 transitions. [2025-01-09 00:22:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1447 [2025-01-09 00:22:35,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:35,753 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:22:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:22:35,753 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:35,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1122082976, now seen corresponding path program 1 times [2025-01-09 00:22:35,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:35,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271355748] [2025-01-09 00:22:35,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:35,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:35,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1446 statements into 1 equivalence classes. [2025-01-09 00:22:35,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1446 of 1446 statements. [2025-01-09 00:22:35,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:35,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2779 backedges. 1733 proven. 0 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked. [2025-01-09 00:22:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271355748] [2025-01-09 00:22:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271355748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:36,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772678355] [2025-01-09 00:22:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:36,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:36,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:36,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:36,881 INFO L87 Difference]: Start difference. First operand 53134 states and 55129 transitions. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:38,349 INFO L93 Difference]: Finished difference Result 105576 states and 109565 transitions. [2025-01-09 00:22:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:38,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 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 1446 [2025-01-09 00:22:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:38,410 INFO L225 Difference]: With dead ends: 105576 [2025-01-09 00:22:38,410 INFO L226 Difference]: Without dead ends: 53134 [2025-01-09 00:22:38,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:38,444 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 596 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:38,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 155 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:22:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53134 states. [2025-01-09 00:22:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 50374. [2025-01-09 00:22:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50374 states, 50373 states have (on average 1.026780219562067) internal successors, (51722), 50373 states have internal predecessors, (51722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 51722 transitions. [2025-01-09 00:22:39,014 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 51722 transitions. Word has length 1446 [2025-01-09 00:22:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:39,015 INFO L471 AbstractCegarLoop]: Abstraction has 50374 states and 51722 transitions. [2025-01-09 00:22:39,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 51722 transitions. [2025-01-09 00:22:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1462 [2025-01-09 00:22:39,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:39,048 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:22:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:22:39,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1249129650, now seen corresponding path program 1 times [2025-01-09 00:22:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:39,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384011892] [2025-01-09 00:22:39,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1461 statements into 1 equivalence classes. [2025-01-09 00:22:39,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1461 of 1461 statements. [2025-01-09 00:22:39,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:39,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1257 proven. 0 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [2025-01-09 00:22:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384011892] [2025-01-09 00:22:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384011892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:39,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336233131] [2025-01-09 00:22:39,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:39,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:39,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:39,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:39,657 INFO L87 Difference]: Start difference. First operand 50374 states and 51722 transitions. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:41,187 INFO L93 Difference]: Finished difference Result 111786 states and 115018 transitions. [2025-01-09 00:22:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:41,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 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 1461 [2025-01-09 00:22:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:41,247 INFO L225 Difference]: With dead ends: 111786 [2025-01-09 00:22:41,247 INFO L226 Difference]: Without dead ends: 62104 [2025-01-09 00:22:41,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:41,275 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 454 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:41,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 964 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:22:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2025-01-09 00:22:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 60724. [2025-01-09 00:22:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60724 states, 60723 states have (on average 1.0256574938655862) internal successors, (62281), 60723 states have internal predecessors, (62281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60724 states to 60724 states and 62281 transitions. [2025-01-09 00:22:41,792 INFO L78 Accepts]: Start accepts. Automaton has 60724 states and 62281 transitions. Word has length 1461 [2025-01-09 00:22:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:41,793 INFO L471 AbstractCegarLoop]: Abstraction has 60724 states and 62281 transitions. [2025-01-09 00:22:41,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 60724 states and 62281 transitions. [2025-01-09 00:22:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1473 [2025-01-09 00:22:41,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:41,813 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:41,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:22:41,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:41,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1381417745, now seen corresponding path program 1 times [2025-01-09 00:22:41,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:41,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057262379] [2025-01-09 00:22:41,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:41,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-01-09 00:22:41,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-01-09 00:22:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2025-01-09 00:22:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057262379] [2025-01-09 00:22:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057262379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:43,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:43,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231364840] [2025-01-09 00:22:43,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:43,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:43,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:43,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:43,111 INFO L87 Difference]: Start difference. First operand 60724 states and 62281 transitions. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:44,431 INFO L93 Difference]: Finished difference Result 121446 states and 124569 transitions. [2025-01-09 00:22:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 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 1472 [2025-01-09 00:22:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:44,490 INFO L225 Difference]: With dead ends: 121446 [2025-01-09 00:22:44,490 INFO L226 Difference]: Without dead ends: 61414 [2025-01-09 00:22:44,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-01-09 00:22:44,524 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 644 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:44,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 763 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:22:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2025-01-09 00:22:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 60034. [2025-01-09 00:22:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60034 states, 60033 states have (on average 1.0237202871753868) internal successors, (61457), 60033 states have internal predecessors, (61457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 61457 transitions. [2025-01-09 00:22:45,088 INFO L78 Accepts]: Start accepts. Automaton has 60034 states and 61457 transitions. Word has length 1472 [2025-01-09 00:22:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:45,089 INFO L471 AbstractCegarLoop]: Abstraction has 60034 states and 61457 transitions. [2025-01-09 00:22:45,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 60034 states and 61457 transitions. [2025-01-09 00:22:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1478 [2025-01-09 00:22:45,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:45,110 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:45,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:22:45,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:45,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1611501602, now seen corresponding path program 1 times [2025-01-09 00:22:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208047348] [2025-01-09 00:22:45,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:45,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1477 statements into 1 equivalence classes. [2025-01-09 00:22:45,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1477 of 1477 statements. [2025-01-09 00:22:45,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:45,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 1420 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-01-09 00:22:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208047348] [2025-01-09 00:22:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208047348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:45,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:45,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:22:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795873861] [2025-01-09 00:22:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:45,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:22:45,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:45,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:22:45,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:45,770 INFO L87 Difference]: Start difference. First operand 60034 states and 61457 transitions. Second operand has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:47,346 INFO L93 Difference]: Finished difference Result 144906 states and 148504 transitions. [2025-01-09 00:22:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:22:47,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 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 1477 [2025-01-09 00:22:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:47,596 INFO L225 Difference]: With dead ends: 144906 [2025-01-09 00:22:47,596 INFO L226 Difference]: Without dead ends: 85564 [2025-01-09 00:22:47,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:22:47,615 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 614 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:47,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 240 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:22:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85564 states. [2025-01-09 00:22:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85564 to 83494. [2025-01-09 00:22:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83494 states, 83493 states have (on average 1.0218102116345082) internal successors, (85314), 83493 states have internal predecessors, (85314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83494 states to 83494 states and 85314 transitions. [2025-01-09 00:22:48,548 INFO L78 Accepts]: Start accepts. Automaton has 83494 states and 85314 transitions. Word has length 1477 [2025-01-09 00:22:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 83494 states and 85314 transitions. [2025-01-09 00:22:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 83494 states and 85314 transitions. [2025-01-09 00:22:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1539 [2025-01-09 00:22:48,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:48,589 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:48,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:22:48,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:48,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:48,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1920713241, now seen corresponding path program 1 times [2025-01-09 00:22:48,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:48,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787135790] [2025-01-09 00:22:48,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:48,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:48,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1538 statements into 1 equivalence classes. [2025-01-09 00:22:48,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1538 of 1538 statements. [2025-01-09 00:22:48,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:48,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 2781 trivial. 0 not checked. [2025-01-09 00:22:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787135790] [2025-01-09 00:22:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787135790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:49,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:22:49,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830917640] [2025-01-09 00:22:49,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:49,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:49,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:49,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:49,425 INFO L87 Difference]: Start difference. First operand 83494 states and 85314 transitions. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:51,759 INFO L93 Difference]: Finished difference Result 183553 states and 187752 transitions. [2025-01-09 00:22:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:22:51,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 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 1538 [2025-01-09 00:22:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:51,872 INFO L225 Difference]: With dead ends: 183553 [2025-01-09 00:22:51,872 INFO L226 Difference]: Without dead ends: 100054 [2025-01-09 00:22:51,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 00:22:51,923 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1407 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3433 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 3433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:51,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 169 Invalid, 3764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 3433 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:22:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100054 states. [2025-01-09 00:22:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100054 to 96604. [2025-01-09 00:22:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96604 states, 96603 states have (on average 1.0223595540511163) internal successors, (98763), 96603 states have internal predecessors, (98763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96604 states to 96604 states and 98763 transitions. [2025-01-09 00:22:53,054 INFO L78 Accepts]: Start accepts. Automaton has 96604 states and 98763 transitions. Word has length 1538 [2025-01-09 00:22:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:53,054 INFO L471 AbstractCegarLoop]: Abstraction has 96604 states and 98763 transitions. [2025-01-09 00:22:53,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 96604 states and 98763 transitions. [2025-01-09 00:22:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1638 [2025-01-09 00:22:53,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:53,088 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:53,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:22:53,088 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:53,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1559936923, now seen corresponding path program 1 times [2025-01-09 00:22:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:53,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605952415] [2025-01-09 00:22:53,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:53,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1637 statements into 1 equivalence classes. [2025-01-09 00:22:53,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1637 of 1637 statements. [2025-01-09 00:22:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:22:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2682 backedges. 2018 proven. 0 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-01-09 00:22:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:22:54,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605952415] [2025-01-09 00:22:54,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605952415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:22:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:22:54,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:22:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887969383] [2025-01-09 00:22:54,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:22:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:22:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:22:54,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:22:54,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:22:54,836 INFO L87 Difference]: Start difference. First operand 96604 states and 98763 transitions. Second operand has 4 states, 4 states have (on average 281.25) internal successors, (1125), 4 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:22:57,571 INFO L93 Difference]: Finished difference Result 223566 states and 228766 transitions. [2025-01-09 00:22:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:22:57,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 281.25) internal successors, (1125), 4 states have internal predecessors, (1125), 0 states have call successors, (0), 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 1637 [2025-01-09 00:22:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:22:57,703 INFO L225 Difference]: With dead ends: 223566 [2025-01-09 00:22:57,703 INFO L226 Difference]: Without dead ends: 127654 [2025-01-09 00:22:57,733 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-01-09 00:22:57,733 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 1251 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3270 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 3270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:22:57,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 946 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 3270 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:22:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127654 states. [2025-01-09 00:22:58,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127654 to 126274. [2025-01-09 00:22:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126274 states, 126273 states have (on average 1.0191093899725199) internal successors, (128686), 126273 states have internal predecessors, (128686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126274 states to 126274 states and 128686 transitions. [2025-01-09 00:22:58,911 INFO L78 Accepts]: Start accepts. Automaton has 126274 states and 128686 transitions. Word has length 1637 [2025-01-09 00:22:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:22:58,912 INFO L471 AbstractCegarLoop]: Abstraction has 126274 states and 128686 transitions. [2025-01-09 00:22:58,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.25) internal successors, (1125), 4 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:22:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 126274 states and 128686 transitions. [2025-01-09 00:22:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1797 [2025-01-09 00:22:58,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:22:58,949 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:22:58,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:22:58,949 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:22:58,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:22:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2136320322, now seen corresponding path program 1 times [2025-01-09 00:22:58,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:22:58,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407586572] [2025-01-09 00:22:58,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:22:58,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:22:59,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1796 statements into 1 equivalence classes. [2025-01-09 00:22:59,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1796 of 1796 statements. [2025-01-09 00:22:59,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:22:59,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3191 backedges. 1337 proven. 0 refuted. 0 times theorem prover too weak. 1854 trivial. 0 not checked. [2025-01-09 00:23:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407586572] [2025-01-09 00:23:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407586572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:00,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:00,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:23:00,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577405552] [2025-01-09 00:23:00,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:00,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:00,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:00,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:00,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:00,543 INFO L87 Difference]: Start difference. First operand 126274 states and 128686 transitions. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:23:02,461 INFO L93 Difference]: Finished difference Result 255996 states and 260938 transitions. [2025-01-09 00:23:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:23:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 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 1796 [2025-01-09 00:23:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:23:02,603 INFO L225 Difference]: With dead ends: 255996 [2025-01-09 00:23:02,603 INFO L226 Difference]: Without dead ends: 130414 [2025-01-09 00:23:02,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:02,679 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 300 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:23:02,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 817 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:23:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130414 states. [2025-01-09 00:23:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130414 to 125584. [2025-01-09 00:23:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125584 states, 125583 states have (on average 1.0176138490082256) internal successors, (127795), 125583 states have internal predecessors, (127795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125584 states to 125584 states and 127795 transitions. [2025-01-09 00:23:03,977 INFO L78 Accepts]: Start accepts. Automaton has 125584 states and 127795 transitions. Word has length 1796 [2025-01-09 00:23:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:23:03,978 INFO L471 AbstractCegarLoop]: Abstraction has 125584 states and 127795 transitions. [2025-01-09 00:23:03,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 125584 states and 127795 transitions. [2025-01-09 00:23:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1920 [2025-01-09 00:23:04,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:04,034 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:23:04,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:23:04,034 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 20437272, now seen corresponding path program 1 times [2025-01-09 00:23:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285974285] [2025-01-09 00:23:04,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:04,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1919 statements into 1 equivalence classes. [2025-01-09 00:23:04,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1919 of 1919 statements. [2025-01-09 00:23:04,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:04,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 2481 trivial. 0 not checked. [2025-01-09 00:23:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:06,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285974285] [2025-01-09 00:23:06,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285974285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:23:06,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:23:06,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:23:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782364470] [2025-01-09 00:23:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:06,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:06,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:06,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:23:06,118 INFO L87 Difference]: Start difference. First operand 125584 states and 127795 transitions. Second operand has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:23:07,702 INFO L93 Difference]: Finished difference Result 250476 states and 254897 transitions. [2025-01-09 00:23:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:23:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 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 1919 [2025-01-09 00:23:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:23:07,871 INFO L225 Difference]: With dead ends: 250476 [2025-01-09 00:23:07,871 INFO L226 Difference]: Without dead ends: 125584 [2025-01-09 00:23:07,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-01-09 00:23:07,926 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 312 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:23:07,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 70 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:23:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125584 states. [2025-01-09 00:23:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125584 to 125584. [2025-01-09 00:23:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125584 states, 125583 states have (on average 1.015551467953465) internal successors, (127536), 125583 states have internal predecessors, (127536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125584 states to 125584 states and 127536 transitions. [2025-01-09 00:23:09,294 INFO L78 Accepts]: Start accepts. Automaton has 125584 states and 127536 transitions. Word has length 1919 [2025-01-09 00:23:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:23:09,295 INFO L471 AbstractCegarLoop]: Abstraction has 125584 states and 127536 transitions. [2025-01-09 00:23:09,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 125584 states and 127536 transitions. [2025-01-09 00:23:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2178 [2025-01-09 00:23:09,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:23:09,414 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 3, 3, 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] [2025-01-09 00:23:09,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:23:09,414 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:23:09,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:23:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1013761130, now seen corresponding path program 1 times [2025-01-09 00:23:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:23:09,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023842703] [2025-01-09 00:23:09,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:09,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:23:09,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2177 statements into 1 equivalence classes. [2025-01-09 00:23:09,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2177 of 2177 statements. [2025-01-09 00:23:09,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:09,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 1920 proven. 1924 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-01-09 00:23:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:23:14,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023842703] [2025-01-09 00:23:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023842703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:23:14,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561668310] [2025-01-09 00:23:14,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:23:14,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:23:14,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:23:14,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:23:14,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:23:14,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2177 statements into 1 equivalence classes. [2025-01-09 00:23:15,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2177 of 2177 statements. [2025-01-09 00:23:15,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:23:15,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:23:15,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:23:15,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:23:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 3338 proven. 67 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2025-01-09 00:23:15,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:23:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 2735 proven. 0 refuted. 0 times theorem prover too weak. 1694 trivial. 0 not checked. [2025-01-09 00:23:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561668310] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:23:15,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:23:15,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 10 [2025-01-09 00:23:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11698624] [2025-01-09 00:23:15,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:23:15,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:23:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:23:15,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:23:15,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:23:15,791 INFO L87 Difference]: Start difference. First operand 125584 states and 127536 transitions. Second operand has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:23:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:23:17,733 INFO L93 Difference]: Finished difference Result 253236 states and 257182 transitions. [2025-01-09 00:23:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:23:17,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 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 2177 [2025-01-09 00:23:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:23:17,872 INFO L225 Difference]: With dead ends: 253236 [2025-01-09 00:23:17,872 INFO L226 Difference]: Without dead ends: 128344 [2025-01-09 00:23:17,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4360 GetRequests, 4352 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:23:17,939 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 654 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:23:17,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 872 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]