./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.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/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.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 1bb463b167b254c80aafe9ad09b54a56308dc50dcf4a4adbb2aa58670e8927d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:27:50,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:27:50,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:27:50,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:27:50,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:27:50,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:27:50,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:27:50,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:27:50,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:27:50,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:27:50,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:27:50,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:27:50,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:27:50,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:27:50,440 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:27:50,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:27:50,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:27:50,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:27:50,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:27:50,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:27:50,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:27:50,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:27:50,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:50,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:50,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:50,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:50,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:27:50,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:50,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:50,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:50,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:50,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:27:50,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:27:50,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:27:50,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:27:50,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:27:50,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:27:50,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:27:50,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:27:50,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:27:50,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:27:50,445 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 -> 1bb463b167b254c80aafe9ad09b54a56308dc50dcf4a4adbb2aa58670e8927d0 [2025-01-09 04:27:50,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:27:50,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:27:50,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:27:50,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:27:50,740 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:27:50,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2025-01-09 04:27:52,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c191c9d9/6cf50fe5614d4dfa8b45775a27fab2b5/FLAG98d050c8a [2025-01-09 04:27:52,509 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:27:52,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2025-01-09 04:27:52,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c191c9d9/6cf50fe5614d4dfa8b45775a27fab2b5/FLAG98d050c8a [2025-01-09 04:27:52,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c191c9d9/6cf50fe5614d4dfa8b45775a27fab2b5 [2025-01-09 04:27:52,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:27:52,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:27:52,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:52,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:27:52,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:27:52,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:52" (1/1) ... [2025-01-09 04:27:52,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f37ac0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:52, skipping insertion in model container [2025-01-09 04:27:52,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:52" (1/1) ... [2025-01-09 04:27:52,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:27:52,954 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/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c[30998,31011] [2025-01-09 04:27:52,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:52,971 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:27:53,088 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/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c[30998,31011] [2025-01-09 04:27:53,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:53,105 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:27:53,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53 WrapperNode [2025-01-09 04:27:53,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:53,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:53,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:27:53,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:27:53,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,182 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1019 [2025-01-09 04:27:53,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:53,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:27:53,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:27:53,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:27:53,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,226 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 04:27:53,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:27:53,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:27:53,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:27:53,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:27:53,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (1/1) ... [2025-01-09 04:27:53,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:53,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:27:53,308 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 04:27:53,311 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 04:27:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:27:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:27:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:27:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:27:53,479 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:27:53,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:27:54,616 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-01-09 04:27:54,616 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:27:54,633 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:27:54,633 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:27:54,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:54 BoogieIcfgContainer [2025-01-09 04:27:54,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:27:54,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:27:54,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:27:54,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:27:54,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:27:52" (1/3) ... [2025-01-09 04:27:54,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc938ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:54, skipping insertion in model container [2025-01-09 04:27:54,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:53" (2/3) ... [2025-01-09 04:27:54,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc938ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:54, skipping insertion in model container [2025-01-09 04:27:54,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:54" (3/3) ... [2025-01-09 04:27:54,645 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2025-01-09 04:27:54,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:27:54,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c that has 1 procedures, 299 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:27:54,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:27:54,743 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;@24cd1990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:27:54,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:27:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 297 states have (on average 1.8316498316498318) internal successors, (544), 298 states have internal predecessors, (544), 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 04:27:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:54,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:54,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:54,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:54,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1447095500, now seen corresponding path program 1 times [2025-01-09 04:27:54,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:54,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524984496] [2025-01-09 04:27:54,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:54,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:55,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:55,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:55,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:55,309 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 04:27:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524984496] [2025-01-09 04:27:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524984496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:27:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884728514] [2025-01-09 04:27:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:55,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:27:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:55,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:27:55,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:55,339 INFO L87 Difference]: Start difference. First operand has 299 states, 297 states have (on average 1.8316498316498318) internal successors, (544), 298 states have internal predecessors, (544), 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 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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 04:27:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:55,371 INFO L93 Difference]: Finished difference Result 403 states and 726 transitions. [2025-01-09 04:27:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:27:55,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2025-01-09 04:27:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:55,380 INFO L225 Difference]: With dead ends: 403 [2025-01-09 04:27:55,380 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 04:27:55,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:55,385 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:55,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 04:27:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-01-09 04:27:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.8271186440677967) internal successors, (539), 295 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 04:27:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 539 transitions. [2025-01-09 04:27:55,431 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 539 transitions. Word has length 77 [2025-01-09 04:27:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 539 transitions. [2025-01-09 04:27:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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 04:27:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 539 transitions. [2025-01-09 04:27:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:55,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:55,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:55,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:27:55,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1581109006, now seen corresponding path program 1 times [2025-01-09 04:27:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:55,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452976729] [2025-01-09 04:27:55,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:55,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:55,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:55,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:55,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:55,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:55,939 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 04:27:55,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:55,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452976729] [2025-01-09 04:27:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452976729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:55,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614477138] [2025-01-09 04:27:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:55,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:55,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:55,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:55,942 INFO L87 Difference]: Start difference. First operand 296 states and 539 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 04:27:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,080 INFO L93 Difference]: Finished difference Result 400 states and 720 transitions. [2025-01-09 04:27:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:56,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2025-01-09 04:27:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,083 INFO L225 Difference]: With dead ends: 400 [2025-01-09 04:27:56,085 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 04:27:56,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:56,087 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 0 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2097 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 04:27:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-01-09 04:27:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.6711864406779662) internal successors, (493), 295 states have internal predecessors, (493), 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 04:27:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 493 transitions. [2025-01-09 04:27:56,114 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 493 transitions. Word has length 77 [2025-01-09 04:27:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 493 transitions. [2025-01-09 04:27:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 04:27:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 493 transitions. [2025-01-09 04:27:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:27:56,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:27:56,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1801517016, now seen corresponding path program 1 times [2025-01-09 04:27:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332888879] [2025-01-09 04:27:56,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:27:56,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:27:56,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,409 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 04:27:56,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332888879] [2025-01-09 04:27:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332888879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:56,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400755651] [2025-01-09 04:27:56,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:56,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:56,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:56,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,412 INFO L87 Difference]: Start difference. First operand 296 states and 493 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 04:27:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,469 INFO L93 Difference]: Finished difference Result 484 states and 825 transitions. [2025-01-09 04:27:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:56,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 122 [2025-01-09 04:27:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,473 INFO L225 Difference]: With dead ends: 484 [2025-01-09 04:27:56,473 INFO L226 Difference]: Without dead ends: 384 [2025-01-09 04:27:56,474 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 04:27:56,475 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 147 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 930 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-09 04:27:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2025-01-09 04:27:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.68503937007874) internal successors, (642), 381 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 642 transitions. [2025-01-09 04:27:56,527 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 642 transitions. Word has length 122 [2025-01-09 04:27:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,528 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 642 transitions. [2025-01-09 04:27:56,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 04:27:56,529 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 642 transitions. [2025-01-09 04:27:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 04:27:56,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:27:56,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,534 INFO L85 PathProgramCache]: Analyzing trace with hash 323334639, now seen corresponding path program 1 times [2025-01-09 04:27:56,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092798779] [2025-01-09 04:27:56,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 04:27:56,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 04:27:56,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:56,741 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 04:27:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092798779] [2025-01-09 04:27:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092798779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:56,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493747553] [2025-01-09 04:27:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:56,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:56,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:56,743 INFO L87 Difference]: Start difference. First operand 382 states and 642 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 04:27:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:56,781 INFO L93 Difference]: Finished difference Result 734 states and 1258 transitions. [2025-01-09 04:27:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 125 [2025-01-09 04:27:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:56,785 INFO L225 Difference]: With dead ends: 734 [2025-01-09 04:27:56,785 INFO L226 Difference]: Without dead ends: 548 [2025-01-09 04:27:56,787 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 04:27:56,788 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 148 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:56,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 938 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-01-09 04:27:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2025-01-09 04:27:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.7045871559633028) internal successors, (929), 545 states have internal predecessors, (929), 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 04:27:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 929 transitions. [2025-01-09 04:27:56,812 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 929 transitions. Word has length 125 [2025-01-09 04:27:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:56,813 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 929 transitions. [2025-01-09 04:27:56,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 04:27:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 929 transitions. [2025-01-09 04:27:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:27:56,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:56,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:56,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:27:56,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:56,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1590485435, now seen corresponding path program 1 times [2025-01-09 04:27:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363949013] [2025-01-09 04:27:56,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:56,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:27:56,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:27:56,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:56,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:57,026 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 04:27:57,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363949013] [2025-01-09 04:27:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363949013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:57,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:57,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104567155] [2025-01-09 04:27:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:57,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:57,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:57,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:57,029 INFO L87 Difference]: Start difference. First operand 546 states and 929 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 04:27:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:57,071 INFO L93 Difference]: Finished difference Result 1206 states and 2083 transitions. [2025-01-09 04:27:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 128 [2025-01-09 04:27:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:57,077 INFO L225 Difference]: With dead ends: 1206 [2025-01-09 04:27:57,077 INFO L226 Difference]: Without dead ends: 856 [2025-01-09 04:27:57,079 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 04:27:57,080 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 141 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:57,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 939 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-01-09 04:27:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 854. [2025-01-09 04:27:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 1.7174677608440798) internal successors, (1465), 853 states have internal predecessors, (1465), 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 04:27:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1465 transitions. [2025-01-09 04:27:57,116 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1465 transitions. Word has length 128 [2025-01-09 04:27:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:57,117 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1465 transitions. [2025-01-09 04:27:57,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 04:27:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1465 transitions. [2025-01-09 04:27:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:27:57,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:57,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:57,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:27:57,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:57,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1343913246, now seen corresponding path program 1 times [2025-01-09 04:27:57,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125347162] [2025-01-09 04:27:57,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:57,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:27:57,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:27:57,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:57,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:57,317 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 04:27:57,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:57,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125347162] [2025-01-09 04:27:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125347162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:57,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656680650] [2025-01-09 04:27:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:57,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:57,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:57,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:57,319 INFO L87 Difference]: Start difference. First operand 854 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 04:27:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:57,370 INFO L93 Difference]: Finished difference Result 2090 states and 3619 transitions. [2025-01-09 04:27:57,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:57,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2025-01-09 04:27:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:57,377 INFO L225 Difference]: With dead ends: 2090 [2025-01-09 04:27:57,377 INFO L226 Difference]: Without dead ends: 1432 [2025-01-09 04:27:57,378 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 04:27:57,380 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 134 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:57,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 940 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-01-09 04:27:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1430. [2025-01-09 04:27:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1429 states have (on average 1.722183344996501) internal successors, (2461), 1429 states have internal predecessors, (2461), 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 04:27:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2461 transitions. [2025-01-09 04:27:57,428 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2461 transitions. Word has length 131 [2025-01-09 04:27:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 2461 transitions. [2025-01-09 04:27:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 04:27:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2461 transitions. [2025-01-09 04:27:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 04:27:57,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:57,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:57,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:27:57,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:57,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1907449266, now seen corresponding path program 1 times [2025-01-09 04:27:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:57,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126502167] [2025-01-09 04:27:57,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:57,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:57,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 04:27:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 04:27:57,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:57,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:57,729 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 04:27:57,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126502167] [2025-01-09 04:27:57,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126502167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:57,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:57,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:27:57,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662770846] [2025-01-09 04:27:57,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:57,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:27:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:57,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:27:57,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:27:57,732 INFO L87 Difference]: Start difference. First operand 1430 states and 2461 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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 04:27:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:58,086 INFO L93 Difference]: Finished difference Result 7238 states and 12653 transitions. [2025-01-09 04:27:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:27:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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 134 [2025-01-09 04:27:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:58,113 INFO L225 Difference]: With dead ends: 7238 [2025-01-09 04:27:58,113 INFO L226 Difference]: Without dead ends: 6004 [2025-01-09 04:27:58,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:27:58,121 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1587 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:58,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 3745 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:27:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2025-01-09 04:27:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 2578. [2025-01-09 04:27:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2577 states have (on average 1.7283663174233606) internal successors, (4454), 2577 states have internal predecessors, (4454), 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 04:27:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 4454 transitions. [2025-01-09 04:27:58,240 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 4454 transitions. Word has length 134 [2025-01-09 04:27:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:58,240 INFO L471 AbstractCegarLoop]: Abstraction has 2578 states and 4454 transitions. [2025-01-09 04:27:58,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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 04:27:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 4454 transitions. [2025-01-09 04:27:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 04:27:58,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:58,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:58,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:27:58,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:58,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1095991756, now seen corresponding path program 1 times [2025-01-09 04:27:58,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:58,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747360640] [2025-01-09 04:27:58,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:58,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:58,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 04:27:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 04:27:58,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:58,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:58,437 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 04:27:58,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747360640] [2025-01-09 04:27:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747360640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220037222] [2025-01-09 04:27:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:58,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:58,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:58,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:58,440 INFO L87 Difference]: Start difference. First operand 2578 states and 4454 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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 04:27:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:58,582 INFO L93 Difference]: Finished difference Result 7484 states and 13044 transitions. [2025-01-09 04:27:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:58,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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 135 [2025-01-09 04:27:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:58,606 INFO L225 Difference]: With dead ends: 7484 [2025-01-09 04:27:58,606 INFO L226 Difference]: Without dead ends: 5102 [2025-01-09 04:27:58,612 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 04:27:58,613 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 511 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:58,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1576 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2025-01-09 04:27:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 3823. [2025-01-09 04:27:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3823 states, 3822 states have (on average 1.7318158032443747) internal successors, (6619), 3822 states have internal predecessors, (6619), 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 04:27:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 6619 transitions. [2025-01-09 04:27:58,766 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 6619 transitions. Word has length 135 [2025-01-09 04:27:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:58,766 INFO L471 AbstractCegarLoop]: Abstraction has 3823 states and 6619 transitions. [2025-01-09 04:27:58,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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 04:27:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 6619 transitions. [2025-01-09 04:27:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:27:58,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:58,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:58,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:27:58,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:58,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1716953825, now seen corresponding path program 1 times [2025-01-09 04:27:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966280434] [2025-01-09 04:27:58,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:58,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:27:58,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:27:58,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:58,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:58,962 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 04:27:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966280434] [2025-01-09 04:27:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966280434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:58,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532912015] [2025-01-09 04:27:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:58,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:58,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:58,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:58,963 INFO L87 Difference]: Start difference. First operand 3823 states and 6619 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:27:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:59,062 INFO L93 Difference]: Finished difference Result 8432 states and 14679 transitions. [2025-01-09 04:27:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:59,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2025-01-09 04:27:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:59,090 INFO L225 Difference]: With dead ends: 8432 [2025-01-09 04:27:59,090 INFO L226 Difference]: Without dead ends: 5857 [2025-01-09 04:27:59,097 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 04:27:59,098 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 156 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:59,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1085 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5857 states. [2025-01-09 04:27:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5857 to 5855. [2025-01-09 04:27:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5855 states, 5854 states have (on average 1.7289033139733516) internal successors, (10121), 5854 states have internal predecessors, (10121), 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 04:27:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 10121 transitions. [2025-01-09 04:27:59,290 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 10121 transitions. Word has length 136 [2025-01-09 04:27:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:59,290 INFO L471 AbstractCegarLoop]: Abstraction has 5855 states and 10121 transitions. [2025-01-09 04:27:59,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:27:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 10121 transitions. [2025-01-09 04:27:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:27:59,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:59,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:27:59,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1098996769, now seen corresponding path program 1 times [2025-01-09 04:27:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906267363] [2025-01-09 04:27:59,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:59,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:27:59,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:27:59,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:59,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:59,473 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 04:27:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906267363] [2025-01-09 04:27:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906267363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:59,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:59,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:59,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760589811] [2025-01-09 04:27:59,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:59,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:59,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:59,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:59,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:59,474 INFO L87 Difference]: Start difference. First operand 5855 states and 10121 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:27:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:59,645 INFO L93 Difference]: Finished difference Result 11398 states and 19710 transitions. [2025-01-09 04:27:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:59,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2025-01-09 04:27:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:59,680 INFO L225 Difference]: With dead ends: 11398 [2025-01-09 04:27:59,681 INFO L226 Difference]: Without dead ends: 8284 [2025-01-09 04:27:59,689 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 04:27:59,690 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 142 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:59,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1045 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2025-01-09 04:27:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8282. [2025-01-09 04:27:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8282 states, 8281 states have (on average 1.7197198405989615) internal successors, (14241), 8281 states have internal predecessors, (14241), 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 04:27:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 14241 transitions. [2025-01-09 04:27:59,977 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 14241 transitions. Word has length 136 [2025-01-09 04:27:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:59,977 INFO L471 AbstractCegarLoop]: Abstraction has 8282 states and 14241 transitions. [2025-01-09 04:27:59,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:27:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 14241 transitions. [2025-01-09 04:27:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:27:59,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:59,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:59,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:27:59,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:59,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:59,981 INFO L85 PathProgramCache]: Analyzing trace with hash 607833915, now seen corresponding path program 1 times [2025-01-09 04:27:59,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:59,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883073220] [2025-01-09 04:27:59,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:00,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:28:00,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:28:00,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:00,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:00,151 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 04:28:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883073220] [2025-01-09 04:28:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883073220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054893942] [2025-01-09 04:28:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:00,153 INFO L87 Difference]: Start difference. First operand 8282 states and 14241 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:28:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:00,309 INFO L93 Difference]: Finished difference Result 16052 states and 27606 transitions. [2025-01-09 04:28:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2025-01-09 04:28:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:00,342 INFO L225 Difference]: With dead ends: 16052 [2025-01-09 04:28:00,342 INFO L226 Difference]: Without dead ends: 11642 [2025-01-09 04:28:00,353 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 04:28:00,354 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 135 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:00,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1030 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2025-01-09 04:28:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 11640. [2025-01-09 04:28:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11640 states, 11639 states have (on average 1.7093392903170375) internal successors, (19895), 11639 states have internal predecessors, (19895), 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 04:28:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11640 states to 11640 states and 19895 transitions. [2025-01-09 04:28:00,699 INFO L78 Accepts]: Start accepts. Automaton has 11640 states and 19895 transitions. Word has length 136 [2025-01-09 04:28:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:00,700 INFO L471 AbstractCegarLoop]: Abstraction has 11640 states and 19895 transitions. [2025-01-09 04:28:00,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:28:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11640 states and 19895 transitions. [2025-01-09 04:28:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:28:00,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:00,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:00,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:28:00,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:00,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1541608379, now seen corresponding path program 1 times [2025-01-09 04:28:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:00,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179646582] [2025-01-09 04:28:00,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:00,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:28:00,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:28:00,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:00,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:00,878 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 04:28:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179646582] [2025-01-09 04:28:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179646582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:00,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:28:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817271233] [2025-01-09 04:28:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:00,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:28:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:00,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:28:00,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:28:00,881 INFO L87 Difference]: Start difference. First operand 11640 states and 19895 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 04:28:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:01,265 INFO L93 Difference]: Finished difference Result 35080 states and 60171 transitions. [2025-01-09 04:28:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:28:01,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 136 [2025-01-09 04:28:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:01,323 INFO L225 Difference]: With dead ends: 35080 [2025-01-09 04:28:01,323 INFO L226 Difference]: Without dead ends: 23703 [2025-01-09 04:28:01,343 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 04:28:01,344 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 457 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:01,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1695 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23703 states. [2025-01-09 04:28:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23703 to 17589. [2025-01-09 04:28:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17589 states, 17588 states have (on average 1.7032635888105527) internal successors, (29957), 17588 states have internal predecessors, (29957), 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 04:28:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17589 states to 17589 states and 29957 transitions. [2025-01-09 04:28:01,936 INFO L78 Accepts]: Start accepts. Automaton has 17589 states and 29957 transitions. Word has length 136 [2025-01-09 04:28:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:01,936 INFO L471 AbstractCegarLoop]: Abstraction has 17589 states and 29957 transitions. [2025-01-09 04:28:01,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 04:28:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 17589 states and 29957 transitions. [2025-01-09 04:28:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:28:01,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:01,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:01,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:28:01,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:01,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1112776827, now seen corresponding path program 1 times [2025-01-09 04:28:01,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:01,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882174869] [2025-01-09 04:28:01,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:01,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:28:01,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:28:01,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:01,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:02,080 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 04:28:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:02,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882174869] [2025-01-09 04:28:02,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882174869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:02,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:28:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935658394] [2025-01-09 04:28:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:02,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:28:02,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:02,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:28:02,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:28:02,083 INFO L87 Difference]: Start difference. First operand 17589 states and 29957 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:28:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:02,461 INFO L93 Difference]: Finished difference Result 38810 states and 66020 transitions. [2025-01-09 04:28:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:28:02,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 136 [2025-01-09 04:28:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:02,537 INFO L225 Difference]: With dead ends: 38810 [2025-01-09 04:28:02,537 INFO L226 Difference]: Without dead ends: 26602 [2025-01-09 04:28:02,565 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 04:28:02,565 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 149 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:02,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1078 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26602 states. [2025-01-09 04:28:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26602 to 26600. [2025-01-09 04:28:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26600 states, 26599 states have (on average 1.6881085755103575) internal successors, (44902), 26599 states have internal predecessors, (44902), 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 04:28:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26600 states to 26600 states and 44902 transitions. [2025-01-09 04:28:03,424 INFO L78 Accepts]: Start accepts. Automaton has 26600 states and 44902 transitions. Word has length 136 [2025-01-09 04:28:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:03,424 INFO L471 AbstractCegarLoop]: Abstraction has 26600 states and 44902 transitions. [2025-01-09 04:28:03,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 04:28:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 26600 states and 44902 transitions. [2025-01-09 04:28:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:28:03,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:03,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:03,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:28:03,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:03,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1993149835, now seen corresponding path program 1 times [2025-01-09 04:28:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:03,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281886374] [2025-01-09 04:28:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:28:03,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:28:03,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:03,595 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 04:28:03,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281886374] [2025-01-09 04:28:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281886374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:28:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340991395] [2025-01-09 04:28:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:03,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:28:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:03,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:28:03,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:28:03,598 INFO L87 Difference]: Start difference. First operand 26600 states and 44902 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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 04:28:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:04,344 INFO L93 Difference]: Finished difference Result 86940 states and 146868 transitions. [2025-01-09 04:28:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:28:04,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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 137 [2025-01-09 04:28:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:04,534 INFO L225 Difference]: With dead ends: 86940 [2025-01-09 04:28:04,535 INFO L226 Difference]: Without dead ends: 60568 [2025-01-09 04:28:04,586 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 04:28:04,587 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 507 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:04,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1571 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60568 states. [2025-01-09 04:28:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60568 to 43441. [2025-01-09 04:28:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43441 states, 43440 states have (on average 1.6784300184162062) internal successors, (72911), 43440 states have internal predecessors, (72911), 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 04:28:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43441 states to 43441 states and 72911 transitions. [2025-01-09 04:28:06,045 INFO L78 Accepts]: Start accepts. Automaton has 43441 states and 72911 transitions. Word has length 137 [2025-01-09 04:28:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:06,046 INFO L471 AbstractCegarLoop]: Abstraction has 43441 states and 72911 transitions. [2025-01-09 04:28:06,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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 04:28:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 43441 states and 72911 transitions. [2025-01-09 04:28:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 04:28:06,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:06,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:06,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:28:06,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:06,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 70509116, now seen corresponding path program 1 times [2025-01-09 04:28:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:06,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142253736] [2025-01-09 04:28:06,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:06,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 04:28:06,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 04:28:06,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:06,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:06,218 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 04:28:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142253736] [2025-01-09 04:28:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142253736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:28:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111287877] [2025-01-09 04:28:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:06,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:28:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:06,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:28:06,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:28:06,220 INFO L87 Difference]: Start difference. First operand 43441 states and 72911 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 04:28:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:07,457 INFO L93 Difference]: Finished difference Result 140394 states and 235818 transitions. [2025-01-09 04:28:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:28:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 138 [2025-01-09 04:28:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:07,667 INFO L225 Difference]: With dead ends: 140394 [2025-01-09 04:28:07,667 INFO L226 Difference]: Without dead ends: 97181 [2025-01-09 04:28:07,707 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 04:28:07,708 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 505 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:07,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1573 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97181 states. [2025-01-09 04:28:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97181 to 70086. [2025-01-09 04:28:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70086 states, 70085 states have (on average 1.6690589997859742) internal successors, (116976), 70085 states have internal predecessors, (116976), 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 04:28:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70086 states to 70086 states and 116976 transitions. [2025-01-09 04:28:09,579 INFO L78 Accepts]: Start accepts. Automaton has 70086 states and 116976 transitions. Word has length 138 [2025-01-09 04:28:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:09,579 INFO L471 AbstractCegarLoop]: Abstraction has 70086 states and 116976 transitions. [2025-01-09 04:28:09,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 04:28:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 70086 states and 116976 transitions. [2025-01-09 04:28:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:28:09,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:09,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:09,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:28:09,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1118600180, now seen corresponding path program 1 times [2025-01-09 04:28:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175438890] [2025-01-09 04:28:09,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:09,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:28:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:28:09,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:09,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:10,323 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 04:28:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175438890] [2025-01-09 04:28:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175438890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652167583] [2025-01-09 04:28:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:10,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:10,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:10,324 INFO L87 Difference]: Start difference. First operand 70086 states and 116976 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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 04:28:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:11,419 INFO L93 Difference]: Finished difference Result 139946 states and 233587 transitions. [2025-01-09 04:28:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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 140 [2025-01-09 04:28:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:11,585 INFO L225 Difference]: With dead ends: 139946 [2025-01-09 04:28:11,585 INFO L226 Difference]: Without dead ends: 70088 [2025-01-09 04:28:11,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:28:11,650 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 138 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:11,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2299 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70088 states. [2025-01-09 04:28:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70088 to 70086. [2025-01-09 04:28:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70086 states, 70085 states have (on average 1.6601412570450167) internal successors, (116351), 70085 states have internal predecessors, (116351), 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 04:28:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70086 states to 70086 states and 116351 transitions. [2025-01-09 04:28:13,262 INFO L78 Accepts]: Start accepts. Automaton has 70086 states and 116351 transitions. Word has length 140 [2025-01-09 04:28:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:13,262 INFO L471 AbstractCegarLoop]: Abstraction has 70086 states and 116351 transitions. [2025-01-09 04:28:13,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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 04:28:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 70086 states and 116351 transitions. [2025-01-09 04:28:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:28:13,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:13,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:13,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:28:13,266 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:13,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1480623890, now seen corresponding path program 1 times [2025-01-09 04:28:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378538426] [2025-01-09 04:28:13,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:13,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:28:13,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:28:13,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:13,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:13,908 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 04:28:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378538426] [2025-01-09 04:28:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378538426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:13,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104868491] [2025-01-09 04:28:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:13,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:13,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:13,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:13,913 INFO L87 Difference]: Start difference. First operand 70086 states and 116351 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 04:28:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:15,434 INFO L93 Difference]: Finished difference Result 204952 states and 340663 transitions. [2025-01-09 04:28:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:15,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 143 [2025-01-09 04:28:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:15,765 INFO L225 Difference]: With dead ends: 204952 [2025-01-09 04:28:15,766 INFO L226 Difference]: Without dead ends: 135094 [2025-01-09 04:28:15,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:28:15,833 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 269 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:15,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1857 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135094 states. [2025-01-09 04:28:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135094 to 135092. [2025-01-09 04:28:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135092 states, 135091 states have (on average 1.648222309406252) internal successors, (222660), 135091 states have internal predecessors, (222660), 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 04:28:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135092 states to 135092 states and 222660 transitions. [2025-01-09 04:28:18,957 INFO L78 Accepts]: Start accepts. Automaton has 135092 states and 222660 transitions. Word has length 143 [2025-01-09 04:28:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:18,957 INFO L471 AbstractCegarLoop]: Abstraction has 135092 states and 222660 transitions. [2025-01-09 04:28:18,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 04:28:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 135092 states and 222660 transitions. [2025-01-09 04:28:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 04:28:18,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:18,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:18,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:28:18,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:18,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 913954333, now seen corresponding path program 1 times [2025-01-09 04:28:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:18,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951539874] [2025-01-09 04:28:18,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 04:28:19,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 04:28:19,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:19,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:19,387 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 04:28:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951539874] [2025-01-09 04:28:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951539874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:19,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:28:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734488595] [2025-01-09 04:28:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:19,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:28:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:19,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:28:19,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:19,394 INFO L87 Difference]: Start difference. First operand 135092 states and 222660 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 04:28:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:21,006 INFO L93 Difference]: Finished difference Result 140902 states and 230405 transitions. [2025-01-09 04:28:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:28:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 144 [2025-01-09 04:28:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:21,239 INFO L225 Difference]: With dead ends: 140902 [2025-01-09 04:28:21,240 INFO L226 Difference]: Without dead ends: 140900 [2025-01-09 04:28:21,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:28:21,262 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 0 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:21,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1945 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:28:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140900 states. [2025-01-09 04:28:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140900 to 140900. [2025-01-09 04:28:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140900 states, 140899 states have (on average 1.6213103002860205) internal successors, (228441), 140899 states have internal predecessors, (228441), 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 04:28:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140900 states to 140900 states and 228441 transitions. [2025-01-09 04:28:23,686 INFO L78 Accepts]: Start accepts. Automaton has 140900 states and 228441 transitions. Word has length 144 [2025-01-09 04:28:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:23,686 INFO L471 AbstractCegarLoop]: Abstraction has 140900 states and 228441 transitions. [2025-01-09 04:28:23,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 04:28:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 140900 states and 228441 transitions. [2025-01-09 04:28:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 04:28:23,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:23,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:23,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:28:23,694 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:23,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash 298721866, now seen corresponding path program 1 times [2025-01-09 04:28:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641769736] [2025-01-09 04:28:23,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:23,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 04:28:23,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 04:28:23,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:23,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:28:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:24,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641769736] [2025-01-09 04:28:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641769736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873343487] [2025-01-09 04:28:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:24,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:24,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:24,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:24,045 INFO L87 Difference]: Start difference. First operand 140900 states and 228441 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 04:28:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:26,901 INFO L93 Difference]: Finished difference Result 388622 states and 631644 transitions. [2025-01-09 04:28:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 180 [2025-01-09 04:28:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:27,796 INFO L225 Difference]: With dead ends: 388622 [2025-01-09 04:28:27,796 INFO L226 Difference]: Without dead ends: 324820 [2025-01-09 04:28:27,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:28:27,895 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1021 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:27,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2428 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324820 states. [2025-01-09 04:28:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324820 to 227560. [2025-01-09 04:28:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227560 states, 227559 states have (on average 1.6179496306452392) internal successors, (368179), 227559 states have internal predecessors, (368179), 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 04:28:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227560 states to 227560 states and 368179 transitions. [2025-01-09 04:28:33,356 INFO L78 Accepts]: Start accepts. Automaton has 227560 states and 368179 transitions. Word has length 180 [2025-01-09 04:28:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:28:33,357 INFO L471 AbstractCegarLoop]: Abstraction has 227560 states and 368179 transitions. [2025-01-09 04:28:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 04:28:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 227560 states and 368179 transitions. [2025-01-09 04:28:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 04:28:33,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:28:33,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:33,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:28:33,364 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:28:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:28:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash -319235190, now seen corresponding path program 1 times [2025-01-09 04:28:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:28:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050665659] [2025-01-09 04:28:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:28:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:28:33,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 04:28:33,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 04:28:33,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:28:33,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:28:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:28:33,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:28:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050665659] [2025-01-09 04:28:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050665659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:28:33,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:28:33,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:28:33,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348483912] [2025-01-09 04:28:33,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:28:33,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:28:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:28:33,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:28:33,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:28:33,594 INFO L87 Difference]: Start difference. First operand 227560 states and 368179 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 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 04:28:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:28:36,979 INFO L93 Difference]: Finished difference Result 437514 states and 711170 transitions. [2025-01-09 04:28:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:28:36,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 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 180 [2025-01-09 04:28:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:28:37,719 INFO L225 Difference]: With dead ends: 437514 [2025-01-09 04:28:37,719 INFO L226 Difference]: Without dead ends: 375012 [2025-01-09 04:28:37,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:28:37,844 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 1110 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:28:37,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2521 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:28:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375012 states.