./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 3af6b76c8112c46f4f3f430659495baba58dab9f6300080b3889ede952fb5526 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:55:51,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:55:51,715 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:55:51,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:55:51,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:55:51,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:55:51,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:55:51,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:55:51,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:55:51,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:55:51,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:55:51,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:55:51,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:55:51,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:55:51,735 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:55:51,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:55:51,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:55:51,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:51,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:55:51,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:51,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:55:51,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:55:51,738 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 -> 3af6b76c8112c46f4f3f430659495baba58dab9f6300080b3889ede952fb5526 [2025-01-09 04:55:52,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:55:52,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:55:52,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:55:52,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:55:52,030 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:55:52,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:55:53,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d525ea93/55e23ba784a240ae91742c4cc0f09c1b/FLAGc822335a9 [2025-01-09 04:55:53,491 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:55:53,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:55:53,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d525ea93/55e23ba784a240ae91742c4cc0f09c1b/FLAGc822335a9 [2025-01-09 04:55:53,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d525ea93/55e23ba784a240ae91742c4cc0f09c1b [2025-01-09 04:55:53,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:55:53,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:55:53,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:55:53,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:55:53,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:55:53,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53, skipping insertion in model container [2025-01-09 04:55:53,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:55:53,737 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-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7752,7765] [2025-01-09 04:55:53,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:55:53,765 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:55:53,821 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-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7752,7765] [2025-01-09 04:55:53,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:55:53,866 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:55:53,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53 WrapperNode [2025-01-09 04:55:53,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:55:53,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:55:53,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:55:53,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:55:53,880 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:55:53" (1/1) ... [2025-01-09 04:55:53,900 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:55:53" (1/1) ... [2025-01-09 04:55:53,922 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 670 [2025-01-09 04:55:53,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:55:53,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:55:53,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:55:53,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:55:53,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,948 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:55:53,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:55:53,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:55:53,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:55:53,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:55:53,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (1/1) ... [2025-01-09 04:55:53,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:55:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:55:53,994 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:55:53,998 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:55:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:55:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:55:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:55:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:55:54,126 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:55:54,127 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:55:54,643 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-01-09 04:55:54,643 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:55:54,675 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:55:54,678 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:55:54,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:55:54 BoogieIcfgContainer [2025-01-09 04:55:54,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:55:54,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:55:54,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:55:54,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:55:54,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:55:53" (1/3) ... [2025-01-09 04:55:54,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379a532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:55:54, skipping insertion in model container [2025-01-09 04:55:54,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:55:53" (2/3) ... [2025-01-09 04:55:54,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379a532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:55:54, skipping insertion in model container [2025-01-09 04:55:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:55:54" (3/3) ... [2025-01-09 04:55:54,689 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:55:54,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:55:54,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 149 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:55:54,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:55:54,761 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;@4f0dffc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:55:54,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:55:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7346938775510203) internal successors, (255), 148 states have internal predecessors, (255), 0 states have call successors, (0), 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:55:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:55:54,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:54,770 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] [2025-01-09 04:55:54,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:54,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash -970283638, now seen corresponding path program 1 times [2025-01-09 04:55:54,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:54,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862334395] [2025-01-09 04:55:54,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:54,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:55:54,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:55:54,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:54,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:55,122 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:55:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862334395] [2025-01-09 04:55:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862334395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:55,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:55:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053663124] [2025-01-09 04:55:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:55,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:55:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:55,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:55:55,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:55:55,142 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7346938775510203) internal successors, (255), 148 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:55:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:55,217 INFO L93 Difference]: Finished difference Result 335 states and 559 transitions. [2025-01-09 04:55:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:55:55,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 04:55:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:55,227 INFO L225 Difference]: With dead ends: 335 [2025-01-09 04:55:55,229 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 04:55:55,232 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:55:55,235 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 151 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:55,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 448 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 04:55:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2025-01-09 04:55:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 227 states have internal predecessors, (359), 0 states have call successors, (0), 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:55:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 359 transitions. [2025-01-09 04:55:55,273 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 359 transitions. Word has length 56 [2025-01-09 04:55:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:55,275 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 359 transitions. [2025-01-09 04:55:55,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:55:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 359 transitions. [2025-01-09 04:55:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:55:55,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:55,277 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] [2025-01-09 04:55:55,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:55:55,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:55,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1615417163, now seen corresponding path program 1 times [2025-01-09 04:55:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805156854] [2025-01-09 04:55:55,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:55,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:55:55,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:55:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:55,501 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:55:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805156854] [2025-01-09 04:55:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805156854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:55,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:55:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616807523] [2025-01-09 04:55:55,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:55,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:55:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:55,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:55:55,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:55:55,503 INFO L87 Difference]: Start difference. First operand 228 states and 359 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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:55:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:55,543 INFO L93 Difference]: Finished difference Result 566 states and 911 transitions. [2025-01-09 04:55:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:55:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-01-09 04:55:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:55,547 INFO L225 Difference]: With dead ends: 566 [2025-01-09 04:55:55,548 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 04:55:55,548 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:55:55,548 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 133 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:55,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 424 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 04:55:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2025-01-09 04:55:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 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:55:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2025-01-09 04:55:55,565 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 58 [2025-01-09 04:55:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:55,565 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2025-01-09 04:55:55,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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:55:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2025-01-09 04:55:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:55:55,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:55,567 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] [2025-01-09 04:55:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:55:55,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1881805132, now seen corresponding path program 1 times [2025-01-09 04:55:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673073115] [2025-01-09 04:55:55,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:55,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:55:55,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:55:55,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:55,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:55,694 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:55:55,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:55,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673073115] [2025-01-09 04:55:55,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673073115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:55,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:55,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:55:55,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682782082] [2025-01-09 04:55:55,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:55,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:55:55,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:55,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:55:55,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:55:55,697 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:55:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:55,744 INFO L93 Difference]: Finished difference Result 1021 states and 1648 transitions. [2025-01-09 04:55:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:55:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-01-09 04:55:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:55,748 INFO L225 Difference]: With dead ends: 1021 [2025-01-09 04:55:55,748 INFO L226 Difference]: Without dead ends: 687 [2025-01-09 04:55:55,752 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:55:55,752 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 127 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:55,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 425 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-09 04:55:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2025-01-09 04:55:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.6029411764705883) internal successors, (1090), 680 states have internal predecessors, (1090), 0 states have call successors, (0), 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:55:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1090 transitions. [2025-01-09 04:55:55,772 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1090 transitions. Word has length 60 [2025-01-09 04:55:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:55,773 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1090 transitions. [2025-01-09 04:55:55,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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:55:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1090 transitions. [2025-01-09 04:55:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:55:55,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:55,774 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] [2025-01-09 04:55:55,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:55:55,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 333047117, now seen corresponding path program 1 times [2025-01-09 04:55:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997389797] [2025-01-09 04:55:55,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:55,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:55:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:55:55,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:55,932 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:55:55,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:55,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997389797] [2025-01-09 04:55:55,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997389797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:55,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:55,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:55:55,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219994395] [2025-01-09 04:55:55,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:55,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:55,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:55,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:55,935 INFO L87 Difference]: Start difference. First operand 681 states and 1090 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:55:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:56,115 INFO L93 Difference]: Finished difference Result 2973 states and 4848 transitions. [2025-01-09 04:55:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:55:56,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-01-09 04:55:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:56,123 INFO L225 Difference]: With dead ends: 2973 [2025-01-09 04:55:56,123 INFO L226 Difference]: Without dead ends: 2343 [2025-01-09 04:55:56,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:55:56,125 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 1026 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:56,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1572 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:55:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2025-01-09 04:55:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1233. [2025-01-09 04:55:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 1.6112012987012987) internal successors, (1985), 1232 states have internal predecessors, (1985), 0 states have call successors, (0), 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:55:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1985 transitions. [2025-01-09 04:55:56,170 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1985 transitions. Word has length 62 [2025-01-09 04:55:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:56,170 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1985 transitions. [2025-01-09 04:55:56,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:55:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1985 transitions. [2025-01-09 04:55:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:55:56,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:56,172 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] [2025-01-09 04:55:56,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:55:56,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:56,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1672021844, now seen corresponding path program 1 times [2025-01-09 04:55:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329863163] [2025-01-09 04:55:56,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:56,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:55:56,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:55:56,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:56,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:56,256 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:55:56,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329863163] [2025-01-09 04:55:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329863163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:56,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:56,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322887367] [2025-01-09 04:55:56,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:56,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:55:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:56,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:55:56,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:55:56,258 INFO L87 Difference]: Start difference. First operand 1233 states and 1985 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:55:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:56,323 INFO L93 Difference]: Finished difference Result 3613 states and 5881 transitions. [2025-01-09 04:55:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:55:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-01-09 04:55:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:56,330 INFO L225 Difference]: With dead ends: 3613 [2025-01-09 04:55:56,330 INFO L226 Difference]: Without dead ends: 2431 [2025-01-09 04:55:56,331 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:55:56,331 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 456 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 769 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:56,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 769 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2025-01-09 04:55:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1823. [2025-01-09 04:55:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 1.6169045005488474) internal successors, (2946), 1822 states have internal predecessors, (2946), 0 states have call successors, (0), 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:55:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2946 transitions. [2025-01-09 04:55:56,362 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2946 transitions. Word has length 63 [2025-01-09 04:55:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:56,362 INFO L471 AbstractCegarLoop]: Abstraction has 1823 states and 2946 transitions. [2025-01-09 04:55:56,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:55:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2946 transitions. [2025-01-09 04:55:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:55:56,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:56,364 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] [2025-01-09 04:55:56,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:55:56,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 235123444, now seen corresponding path program 1 times [2025-01-09 04:55:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446427652] [2025-01-09 04:55:56,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:56,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:55:56,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:55:56,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:56,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:56,511 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:55:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446427652] [2025-01-09 04:55:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446427652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:56,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:56,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986921879] [2025-01-09 04:55:56,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:56,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:55:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:56,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:55:56,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:55:56,514 INFO L87 Difference]: Start difference. First operand 1823 states and 2946 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:55:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:56,592 INFO L93 Difference]: Finished difference Result 5307 states and 8625 transitions. [2025-01-09 04:55:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:55:56,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-01-09 04:55:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:56,603 INFO L225 Difference]: With dead ends: 5307 [2025-01-09 04:55:56,604 INFO L226 Difference]: Without dead ends: 3535 [2025-01-09 04:55:56,606 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:55:56,610 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 456 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:56,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 711 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2025-01-09 04:55:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 2667. [2025-01-09 04:55:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2666 states have (on average 1.6151537884471119) internal successors, (4306), 2666 states have internal predecessors, (4306), 0 states have call successors, (0), 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:55:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4306 transitions. [2025-01-09 04:55:56,666 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4306 transitions. Word has length 64 [2025-01-09 04:55:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:56,667 INFO L471 AbstractCegarLoop]: Abstraction has 2667 states and 4306 transitions. [2025-01-09 04:55:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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:55:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4306 transitions. [2025-01-09 04:55:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:55:56,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:56,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:55:56,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:55:56,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:56,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1354495973, now seen corresponding path program 1 times [2025-01-09 04:55:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:56,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068129624] [2025-01-09 04:55:56,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:55:56,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:55:56,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:56,774 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:55:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:56,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068129624] [2025-01-09 04:55:56,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068129624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:56,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:56,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:55:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418024235] [2025-01-09 04:55:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:56,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:55:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:56,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:55:56,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:55:56,776 INFO L87 Difference]: Start difference. First operand 2667 states and 4306 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:56,849 INFO L93 Difference]: Finished difference Result 7707 states and 12501 transitions. [2025-01-09 04:55:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:55:56,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:55:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:56,864 INFO L225 Difference]: With dead ends: 7707 [2025-01-09 04:55:56,865 INFO L226 Difference]: Without dead ends: 5091 [2025-01-09 04:55:56,868 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:55:56,869 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 454 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:56,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 754 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-01-09 04:55:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 3863. [2025-01-09 04:55:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3862 states have (on average 1.6126359399274988) internal successors, (6228), 3862 states have internal predecessors, (6228), 0 states have call successors, (0), 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:55:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 6228 transitions. [2025-01-09 04:55:56,940 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 6228 transitions. Word has length 65 [2025-01-09 04:55:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:56,941 INFO L471 AbstractCegarLoop]: Abstraction has 3863 states and 6228 transitions. [2025-01-09 04:55:56,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:55:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 6228 transitions. [2025-01-09 04:55:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:55:56,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:56,943 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] [2025-01-09 04:55:56,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:55:56,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:56,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1658042238, now seen corresponding path program 1 times [2025-01-09 04:55:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442444291] [2025-01-09 04:55:56,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:56,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:55:56,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:55:56,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:56,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:57,021 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:55:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:57,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442444291] [2025-01-09 04:55:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442444291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:57,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:57,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:55:57,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543718269] [2025-01-09 04:55:57,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:55:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:57,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:55:57,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:55:57,023 INFO L87 Difference]: Start difference. First operand 3863 states and 6228 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:55:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:57,103 INFO L93 Difference]: Finished difference Result 8640 states and 14034 transitions. [2025-01-09 04:55:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:55:57,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:55:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:57,119 INFO L225 Difference]: With dead ends: 8640 [2025-01-09 04:55:57,119 INFO L226 Difference]: Without dead ends: 5875 [2025-01-09 04:55:57,121 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:55:57,122 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 138 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 524 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:55:57,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 524 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5875 states. [2025-01-09 04:55:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5875 to 5873. [2025-01-09 04:55:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5873 states, 5872 states have (on average 1.6130790190735695) internal successors, (9472), 5872 states have internal predecessors, (9472), 0 states have call successors, (0), 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:55:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5873 states to 5873 states and 9472 transitions. [2025-01-09 04:55:57,203 INFO L78 Accepts]: Start accepts. Automaton has 5873 states and 9472 transitions. Word has length 66 [2025-01-09 04:55:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:57,205 INFO L471 AbstractCegarLoop]: Abstraction has 5873 states and 9472 transitions. [2025-01-09 04:55:57,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:55:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5873 states and 9472 transitions. [2025-01-09 04:55:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:55:57,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:57,206 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] [2025-01-09 04:55:57,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:55:57,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:57,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1876407130, now seen corresponding path program 1 times [2025-01-09 04:55:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680700696] [2025-01-09 04:55:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:57,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:55:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:55:57,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:57,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:57,277 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:55:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:57,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680700696] [2025-01-09 04:55:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680700696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:57,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:55:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469919518] [2025-01-09 04:55:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:57,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:55:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:57,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:55:57,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:55:57,279 INFO L87 Difference]: Start difference. First operand 5873 states and 9472 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:55:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:57,370 INFO L93 Difference]: Finished difference Result 12987 states and 20989 transitions. [2025-01-09 04:55:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:55:57,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:55:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:57,400 INFO L225 Difference]: With dead ends: 12987 [2025-01-09 04:55:57,400 INFO L226 Difference]: Without dead ends: 8817 [2025-01-09 04:55:57,404 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:55:57,405 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 126 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 469 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:55:57,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 469 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8817 states. [2025-01-09 04:55:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8817 to 8815. [2025-01-09 04:55:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8815 states, 8814 states have (on average 1.6056274109371456) internal successors, (14152), 8814 states have internal predecessors, (14152), 0 states have call successors, (0), 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:55:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8815 states to 8815 states and 14152 transitions. [2025-01-09 04:55:57,537 INFO L78 Accepts]: Start accepts. Automaton has 8815 states and 14152 transitions. Word has length 66 [2025-01-09 04:55:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:57,538 INFO L471 AbstractCegarLoop]: Abstraction has 8815 states and 14152 transitions. [2025-01-09 04:55:57,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:55:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8815 states and 14152 transitions. [2025-01-09 04:55:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:55:57,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:57,539 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] [2025-01-09 04:55:57,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:55:57,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:57,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash -430026452, now seen corresponding path program 1 times [2025-01-09 04:55:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907973699] [2025-01-09 04:55:57,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:57,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:55:57,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:55:57,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:57,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:57,620 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:55:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907973699] [2025-01-09 04:55:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907973699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:55:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436672497] [2025-01-09 04:55:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:57,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:55:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:57,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:55:57,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:55:57,622 INFO L87 Difference]: Start difference. First operand 8815 states and 14152 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:55:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:57,692 INFO L93 Difference]: Finished difference Result 19164 states and 30838 transitions. [2025-01-09 04:55:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:55:57,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 04:55:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:57,718 INFO L225 Difference]: With dead ends: 19164 [2025-01-09 04:55:57,719 INFO L226 Difference]: Without dead ends: 12900 [2025-01-09 04:55:57,729 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:55:57,729 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 132 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 509 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:55:57,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 509 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12900 states. [2025-01-09 04:55:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12900 to 12898. [2025-01-09 04:55:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12898 states, 12897 states have (on average 1.5971931456927968) internal successors, (20599), 12897 states have internal predecessors, (20599), 0 states have call successors, (0), 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:55:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12898 states to 12898 states and 20599 transitions. [2025-01-09 04:55:57,961 INFO L78 Accepts]: Start accepts. Automaton has 12898 states and 20599 transitions. Word has length 66 [2025-01-09 04:55:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:57,961 INFO L471 AbstractCegarLoop]: Abstraction has 12898 states and 20599 transitions. [2025-01-09 04:55:57,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:55:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 12898 states and 20599 transitions. [2025-01-09 04:55:57,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:55:57,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:57,962 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] [2025-01-09 04:55:57,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:55:57,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:57,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:57,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1812850740, now seen corresponding path program 1 times [2025-01-09 04:55:57,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:57,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700800301] [2025-01-09 04:55:57,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:57,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:57,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:55:57,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:55:57,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:57,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:58,167 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:55:58,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700800301] [2025-01-09 04:55:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700800301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:58,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:58,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:55:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124711553] [2025-01-09 04:55:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:58,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:58,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:58,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:58,168 INFO L87 Difference]: Start difference. First operand 12898 states and 20599 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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:55:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:58,277 INFO L93 Difference]: Finished difference Result 25713 states and 41080 transitions. [2025-01-09 04:55:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:58,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 04:55:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:58,300 INFO L225 Difference]: With dead ends: 25713 [2025-01-09 04:55:58,300 INFO L226 Difference]: Without dead ends: 12900 [2025-01-09 04:55:58,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:55:58,315 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 385 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:58,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 617 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12900 states. [2025-01-09 04:55:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12900 to 12898. [2025-01-09 04:55:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12898 states, 12897 states have (on average 1.5875009692176476) internal successors, (20474), 12897 states have internal predecessors, (20474), 0 states have call successors, (0), 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:55:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12898 states to 12898 states and 20474 transitions. [2025-01-09 04:55:58,528 INFO L78 Accepts]: Start accepts. Automaton has 12898 states and 20474 transitions. Word has length 67 [2025-01-09 04:55:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:58,528 INFO L471 AbstractCegarLoop]: Abstraction has 12898 states and 20474 transitions. [2025-01-09 04:55:58,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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:55:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 12898 states and 20474 transitions. [2025-01-09 04:55:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:55:58,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:58,529 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] [2025-01-09 04:55:58,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:55:58,529 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:58,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash 528800646, now seen corresponding path program 1 times [2025-01-09 04:55:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:58,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656609546] [2025-01-09 04:55:58,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:58,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:55:58,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:55:58,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:58,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:58,681 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:55:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656609546] [2025-01-09 04:55:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656609546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:55:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131788561] [2025-01-09 04:55:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:58,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:58,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:58,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:58,683 INFO L87 Difference]: Start difference. First operand 12898 states and 20474 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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:55:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:58,797 INFO L93 Difference]: Finished difference Result 36933 states and 58774 transitions. [2025-01-09 04:55:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-01-09 04:55:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:58,837 INFO L225 Difference]: With dead ends: 36933 [2025-01-09 04:55:58,838 INFO L226 Difference]: Without dead ends: 24120 [2025-01-09 04:55:58,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:55:58,854 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 253 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:55:58,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 623 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24120 states. [2025-01-09 04:55:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24120 to 24118. [2025-01-09 04:55:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24118 states, 24117 states have (on average 1.5768545009744164) internal successors, (38029), 24117 states have internal predecessors, (38029), 0 states have call successors, (0), 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:55:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24118 states to 24118 states and 38029 transitions. [2025-01-09 04:55:59,201 INFO L78 Accepts]: Start accepts. Automaton has 24118 states and 38029 transitions. Word has length 70 [2025-01-09 04:55:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:55:59,201 INFO L471 AbstractCegarLoop]: Abstraction has 24118 states and 38029 transitions. [2025-01-09 04:55:59,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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:55:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 24118 states and 38029 transitions. [2025-01-09 04:55:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:55:59,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:55:59,202 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] [2025-01-09 04:55:59,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:55:59,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:55:59,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:55:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash -788958455, now seen corresponding path program 1 times [2025-01-09 04:55:59,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:55:59,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006138617] [2025-01-09 04:55:59,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:55:59,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:55:59,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:55:59,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:55:59,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:55:59,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:55:59,570 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:55:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:55:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006138617] [2025-01-09 04:55:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006138617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:55:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:55:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:55:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573882540] [2025-01-09 04:55:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:55:59,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:55:59,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:55:59,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:55:59,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:55:59,572 INFO L87 Difference]: Start difference. First operand 24118 states and 38029 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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:55:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:55:59,650 INFO L93 Difference]: Finished difference Result 24844 states and 39116 transitions. [2025-01-09 04:55:59,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:55:59,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-09 04:55:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:55:59,687 INFO L225 Difference]: With dead ends: 24844 [2025-01-09 04:55:59,687 INFO L226 Difference]: Without dead ends: 24842 [2025-01-09 04:55:59,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:55:59,697 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 880 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:55:59,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 880 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:55:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24842 states. [2025-01-09 04:55:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24842 to 24842. [2025-01-09 04:56:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24842 states, 24841 states have (on average 1.5596795620144117) internal successors, (38744), 24841 states have internal predecessors, (38744), 0 states have call successors, (0), 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:56:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24842 states to 24842 states and 38744 transitions. [2025-01-09 04:56:00,039 INFO L78 Accepts]: Start accepts. Automaton has 24842 states and 38744 transitions. Word has length 71 [2025-01-09 04:56:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:00,040 INFO L471 AbstractCegarLoop]: Abstraction has 24842 states and 38744 transitions. [2025-01-09 04:56:00,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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:56:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 24842 states and 38744 transitions. [2025-01-09 04:56:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:56:00,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:00,041 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:00,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:56:00,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:00,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1288596918, now seen corresponding path program 1 times [2025-01-09 04:56:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:00,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644475145] [2025-01-09 04:56:00,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:00,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:00,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:56:00,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:56:00,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:00,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:56:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644475145] [2025-01-09 04:56:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644475145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831596356] [2025-01-09 04:56:00,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:00,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:00,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:00,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:00,144 INFO L87 Difference]: Start difference. First operand 24842 states and 38744 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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:56:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:00,310 INFO L93 Difference]: Finished difference Result 60730 states and 95066 transitions. [2025-01-09 04:56:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 97 [2025-01-09 04:56:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:00,374 INFO L225 Difference]: With dead ends: 60730 [2025-01-09 04:56:00,374 INFO L226 Difference]: Without dead ends: 48768 [2025-01-09 04:56:00,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:56:00,397 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 575 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:00,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1025 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48768 states. [2025-01-09 04:56:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48768 to 38122. [2025-01-09 04:56:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38122 states, 38121 states have (on average 1.5579864116890954) internal successors, (59392), 38121 states have internal predecessors, (59392), 0 states have call successors, (0), 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:56:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38122 states to 38122 states and 59392 transitions. [2025-01-09 04:56:00,916 INFO L78 Accepts]: Start accepts. Automaton has 38122 states and 59392 transitions. Word has length 97 [2025-01-09 04:56:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:00,916 INFO L471 AbstractCegarLoop]: Abstraction has 38122 states and 59392 transitions. [2025-01-09 04:56:00,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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:56:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 38122 states and 59392 transitions. [2025-01-09 04:56:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:56:00,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:00,918 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:00,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:56:00,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:00,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1070232026, now seen corresponding path program 1 times [2025-01-09 04:56:00,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:00,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736427121] [2025-01-09 04:56:00,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:00,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:00,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:56:00,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:56:00,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:00,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:56:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736427121] [2025-01-09 04:56:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736427121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983962988] [2025-01-09 04:56:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:01,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:01,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:01,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:01,015 INFO L87 Difference]: Start difference. First operand 38122 states and 59392 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:56:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:01,421 INFO L93 Difference]: Finished difference Result 68116 states and 106638 transitions. [2025-01-09 04:56:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:01,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 97 [2025-01-09 04:56:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:01,633 INFO L225 Difference]: With dead ends: 68116 [2025-01-09 04:56:01,637 INFO L226 Difference]: Without dead ends: 56384 [2025-01-09 04:56:01,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:56:01,668 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 584 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:01,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1090 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56384 states. [2025-01-09 04:56:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56384 to 51626. [2025-01-09 04:56:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51626 states, 51625 states have (on average 1.5596707021791767) internal successors, (80518), 51625 states have internal predecessors, (80518), 0 states have call successors, (0), 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:56:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51626 states to 51626 states and 80518 transitions. [2025-01-09 04:56:02,515 INFO L78 Accepts]: Start accepts. Automaton has 51626 states and 80518 transitions. Word has length 97 [2025-01-09 04:56:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:02,515 INFO L471 AbstractCegarLoop]: Abstraction has 51626 states and 80518 transitions. [2025-01-09 04:56:02,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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:56:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 51626 states and 80518 transitions. [2025-01-09 04:56:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:56:02,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:02,518 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:02,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:56:02,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:02,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash 918301688, now seen corresponding path program 1 times [2025-01-09 04:56:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978986450] [2025-01-09 04:56:02,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:02,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:56:02,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:56:02,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:02,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:56:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978986450] [2025-01-09 04:56:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978986450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:02,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343454717] [2025-01-09 04:56:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:02,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:02,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:02,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:02,666 INFO L87 Difference]: Start difference. First operand 51626 states and 80518 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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:56:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:02,905 INFO L93 Difference]: Finished difference Result 72776 states and 113938 transitions. [2025-01-09 04:56:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:02,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 97 [2025-01-09 04:56:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:02,988 INFO L225 Difference]: With dead ends: 72776 [2025-01-09 04:56:02,988 INFO L226 Difference]: Without dead ends: 61044 [2025-01-09 04:56:03,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:56:03,014 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 583 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:03,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1063 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61044 states. [2025-01-09 04:56:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61044 to 59150. [2025-01-09 04:56:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59150 states, 59149 states have (on average 1.5613788905983195) internal successors, (92354), 59149 states have internal predecessors, (92354), 0 states have call successors, (0), 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:56:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59150 states to 59150 states and 92354 transitions. [2025-01-09 04:56:04,261 INFO L78 Accepts]: Start accepts. Automaton has 59150 states and 92354 transitions. Word has length 97 [2025-01-09 04:56:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:04,262 INFO L471 AbstractCegarLoop]: Abstraction has 59150 states and 92354 transitions. [2025-01-09 04:56:04,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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:56:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 59150 states and 92354 transitions. [2025-01-09 04:56:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:56:04,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:04,265 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:04,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:56:04,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1354302985, now seen corresponding path program 1 times [2025-01-09 04:56:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665084660] [2025-01-09 04:56:04,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:04,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:56:04,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:56:04,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:04,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:56:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665084660] [2025-01-09 04:56:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665084660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:04,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473458071] [2025-01-09 04:56:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:04,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:04,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:04,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:04,565 INFO L87 Difference]: Start difference. First operand 59150 states and 92354 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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:56:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:04,750 INFO L93 Difference]: Finished difference Result 96273 states and 151013 transitions. [2025-01-09 04:56:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:04,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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 98 [2025-01-09 04:56:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:04,844 INFO L225 Difference]: With dead ends: 96273 [2025-01-09 04:56:04,845 INFO L226 Difference]: Without dead ends: 76695 [2025-01-09 04:56:04,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:04,879 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 266 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:04,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 725 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76695 states. [2025-01-09 04:56:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76695 to 74803. [2025-01-09 04:56:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74803 states, 74802 states have (on average 1.5616962113312478) internal successors, (116818), 74802 states have internal predecessors, (116818), 0 states have call successors, (0), 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:56:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74803 states to 74803 states and 116818 transitions. [2025-01-09 04:56:05,846 INFO L78 Accepts]: Start accepts. Automaton has 74803 states and 116818 transitions. Word has length 98 [2025-01-09 04:56:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:05,847 INFO L471 AbstractCegarLoop]: Abstraction has 74803 states and 116818 transitions. [2025-01-09 04:56:05,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 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:56:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 74803 states and 116818 transitions. [2025-01-09 04:56:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:56:05,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:05,853 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:05,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:56:05,853 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1163404503, now seen corresponding path program 1 times [2025-01-09 04:56:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148887976] [2025-01-09 04:56:05,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:05,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:56:05,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:56:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:05,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:56:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148887976] [2025-01-09 04:56:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148887976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:06,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349384200] [2025-01-09 04:56:06,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:06,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:06,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:06,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:06,202 INFO L87 Difference]: Start difference. First operand 74803 states and 116818 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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:56:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:06,861 INFO L93 Difference]: Finished difference Result 161245 states and 252601 transitions. [2025-01-09 04:56:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:06,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 98 [2025-01-09 04:56:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:07,057 INFO L225 Difference]: With dead ends: 161245 [2025-01-09 04:56:07,057 INFO L226 Difference]: Without dead ends: 126183 [2025-01-09 04:56:07,089 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:56:07,090 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 117 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:07,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 416 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126183 states. [2025-01-09 04:56:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126183 to 125905. [2025-01-09 04:56:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125905 states, 125904 states have (on average 1.5618089973313) internal successors, (196638), 125904 states have internal predecessors, (196638), 0 states have call successors, (0), 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:56:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125905 states to 125905 states and 196638 transitions. [2025-01-09 04:56:09,004 INFO L78 Accepts]: Start accepts. Automaton has 125905 states and 196638 transitions. Word has length 98 [2025-01-09 04:56:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:09,004 INFO L471 AbstractCegarLoop]: Abstraction has 125905 states and 196638 transitions. [2025-01-09 04:56:09,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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:56:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 125905 states and 196638 transitions. [2025-01-09 04:56:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:56:09,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:09,006 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:56:09,007 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1010324438, now seen corresponding path program 1 times [2025-01-09 04:56:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981181185] [2025-01-09 04:56:09,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:09,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:56:09,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:56:09,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:09,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:09,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:09,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981181185] [2025-01-09 04:56:09,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981181185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:09,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:09,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:09,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844780285] [2025-01-09 04:56:09,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:09,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:09,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:09,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:09,081 INFO L87 Difference]: Start difference. First operand 125905 states and 196638 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:56:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:10,373 INFO L93 Difference]: Finished difference Result 370545 states and 578061 transitions. [2025-01-09 04:56:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:56:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:10,832 INFO L225 Difference]: With dead ends: 370545 [2025-01-09 04:56:10,833 INFO L226 Difference]: Without dead ends: 244725 [2025-01-09 04:56:10,949 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:56:10,950 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 172 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:10,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 543 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244725 states. [2025-01-09 04:56:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244725 to 244723. [2025-01-09 04:56:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244723 states, 244722 states have (on average 1.550056799143518) internal successors, (379333), 244722 states have internal predecessors, (379333), 0 states have call successors, (0), 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:56:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244723 states to 244723 states and 379333 transitions. [2025-01-09 04:56:14,426 INFO L78 Accepts]: Start accepts. Automaton has 244723 states and 379333 transitions. Word has length 99 [2025-01-09 04:56:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:14,426 INFO L471 AbstractCegarLoop]: Abstraction has 244723 states and 379333 transitions. [2025-01-09 04:56:14,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:56:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 244723 states and 379333 transitions. [2025-01-09 04:56:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:56:14,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:14,431 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:14,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:56:14,431 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:14,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1491741236, now seen corresponding path program 1 times [2025-01-09 04:56:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:14,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490196702] [2025-01-09 04:56:14,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:14,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:56:14,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:56:14,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:14,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490196702] [2025-01-09 04:56:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490196702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:14,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521743536] [2025-01-09 04:56:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:14,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:14,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:14,523 INFO L87 Difference]: Start difference. First operand 244723 states and 379333 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:56:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:17,407 INFO L93 Difference]: Finished difference Result 719857 states and 1114335 transitions. [2025-01-09 04:56:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:17,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 04:56:17,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:18,383 INFO L225 Difference]: With dead ends: 719857 [2025-01-09 04:56:18,383 INFO L226 Difference]: Without dead ends: 475263 [2025-01-09 04:56:18,549 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:56:18,552 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 153 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:18,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 506 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475263 states. [2025-01-09 04:56:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475263 to 475261. [2025-01-09 04:56:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475261 states, 475260 states have (on average 1.53759415898666) internal successors, (730757), 475260 states have internal predecessors, (730757), 0 states have call successors, (0), 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:56:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475261 states to 475261 states and 730757 transitions. [2025-01-09 04:56:25,585 INFO L78 Accepts]: Start accepts. Automaton has 475261 states and 730757 transitions. Word has length 99 [2025-01-09 04:56:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:25,585 INFO L471 AbstractCegarLoop]: Abstraction has 475261 states and 730757 transitions. [2025-01-09 04:56:25,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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:56:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 475261 states and 730757 transitions. [2025-01-09 04:56:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:56:25,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:25,590 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:56:25,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:56:25,594 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:25,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:25,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1028124502, now seen corresponding path program 1 times [2025-01-09 04:56:25,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:25,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314721150] [2025-01-09 04:56:25,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:56:25,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:56:25,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:25,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:56:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314721150] [2025-01-09 04:56:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314721150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:25,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079181082] [2025-01-09 04:56:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:25,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:25,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:25,664 INFO L87 Difference]: Start difference. First operand 475261 states and 730757 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:56:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:28,958 INFO L93 Difference]: Finished difference Result 1017055 states and 1568113 transitions. [2025-01-09 04:56:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 99 [2025-01-09 04:56:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:31,060 INFO L225 Difference]: With dead ends: 1017055 [2025-01-09 04:56:31,060 INFO L226 Difference]: Without dead ends: 751577 [2025-01-09 04:56:31,231 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:56:31,231 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 117 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:31,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 411 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751577 states.