./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84d02f5c6d16b666d2cee6c4cdde3d0f1860509873fce3916089bbbadc66a2c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:16:45,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:16:45,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:16:45,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:16:45,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:16:45,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:16:45,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:16:45,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:16:45,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:16:45,297 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:16:45,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:16:45,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:16:45,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:16:45,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:16:45,298 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:16:45,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:16:45,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:16:45,298 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:16:45,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:16:45,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:16:45,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:16:45,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:16:45,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:16:45,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:16:45,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:16:45,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:16:45,301 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84d02f5c6d16b666d2cee6c4cdde3d0f1860509873fce3916089bbbadc66a2c3 [2025-03-03 16:16:45,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:16:45,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:16:45,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:16:45,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:16:45,545 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:16:45,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:16:46,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b53ce92/20a1ad102c424484855e39170b0fdb8b/FLAG6fb39187c [2025-03-03 16:16:47,225 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:16:47,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:16:47,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b53ce92/20a1ad102c424484855e39170b0fdb8b/FLAG6fb39187c [2025-03-03 16:16:47,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b53ce92/20a1ad102c424484855e39170b0fdb8b [2025-03-03 16:16:47,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:16:47,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:16:47,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:16:47,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:16:47,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:16:47,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:16:47" (1/1) ... [2025-03-03 16:16:47,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb29458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:47, skipping insertion in model container [2025-03-03 16:16:47,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:16:47" (1/1) ... [2025-03-03 16:16:47,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:16:47,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[20454,20467] [2025-03-03 16:16:47,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[28202,28215] [2025-03-03 16:16:48,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:16:48,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:16:48,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[20454,20467] [2025-03-03 16:16:48,196 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c[28202,28215] [2025-03-03 16:16:48,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:16:48,423 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:16:48,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48 WrapperNode [2025-03-03 16:16:48,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:16:48,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:16:48,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:16:48,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:16:48,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,692 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5213 [2025-03-03 16:16:48,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:16:48,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:16:48,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:16:48,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:16:48,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,876 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:16:48,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:48,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:49,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:49,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:49,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:16:49,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:16:49,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:16:49,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:16:49,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (1/1) ... [2025-03-03 16:16:49,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:16:49,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:16:49,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:16:49,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:16:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:16:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:16:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:16:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:16:49,197 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:16:49,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:16:52,589 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret47#1; [2025-03-03 16:16:52,589 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret45#1; [2025-03-03 16:16:52,590 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret46#1; [2025-03-03 16:16:52,707 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-03-03 16:16:52,707 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:16:52,744 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:16:52,744 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:16:52,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:16:52 BoogieIcfgContainer [2025-03-03 16:16:52,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:16:52,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:16:52,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:16:52,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:16:52,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:16:47" (1/3) ... [2025-03-03 16:16:52,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd6989e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:16:52, skipping insertion in model container [2025-03-03 16:16:52,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:16:48" (2/3) ... [2025-03-03 16:16:52,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd6989e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:16:52, skipping insertion in model container [2025-03-03 16:16:52,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:16:52" (3/3) ... [2025-03-03 16:16:52,755 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-03-03 16:16:52,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:16:52,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 931 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:16:52,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:16:52,844 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;@a88ffbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:16:52,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:16:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 16:16:52,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:52,857 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] [2025-03-03 16:16:52,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:52,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1710653810, now seen corresponding path program 1 times [2025-03-03 16:16:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906131477] [2025-03-03 16:16:52,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:52,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 16:16:52,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 16:16:52,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:52,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906131477] [2025-03-03 16:16:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906131477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:16:53,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706073067] [2025-03-03 16:16:53,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:53,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:16:53,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:53,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:16:53,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:16:53,076 INFO L87 Difference]: Start difference. First operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:53,140 INFO L93 Difference]: Finished difference Result 1805 states and 3421 transitions. [2025-03-03 16:16:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:16:53,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-03 16:16:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:53,161 INFO L225 Difference]: With dead ends: 1805 [2025-03-03 16:16:53,161 INFO L226 Difference]: Without dead ends: 866 [2025-03-03 16:16:53,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:16:53,167 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:53,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-03 16:16:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-03 16:16:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8923611111111112) internal successors, (1635), 865 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1635 transitions. [2025-03-03 16:16:53,245 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1635 transitions. Word has length 28 [2025-03-03 16:16:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:53,245 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1635 transitions. [2025-03-03 16:16:53,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1635 transitions. [2025-03-03 16:16:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 16:16:53,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:53,249 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] [2025-03-03 16:16:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:16:53,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 546257197, now seen corresponding path program 1 times [2025-03-03 16:16:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50463384] [2025-03-03 16:16:53,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:53,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 16:16:53,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 16:16:53,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:53,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50463384] [2025-03-03 16:16:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50463384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:53,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:16:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302205571] [2025-03-03 16:16:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:16:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:53,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:16:53,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:16:53,536 INFO L87 Difference]: Start difference. First operand 866 states and 1635 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:53,679 INFO L93 Difference]: Finished difference Result 926 states and 1729 transitions. [2025-03-03 16:16:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:16:53,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-03 16:16:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:53,683 INFO L225 Difference]: With dead ends: 926 [2025-03-03 16:16:53,683 INFO L226 Difference]: Without dead ends: 866 [2025-03-03 16:16:53,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:16:53,684 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 0 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:53,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6477 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:16:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-03 16:16:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-03 16:16:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8344907407407407) internal successors, (1585), 865 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1585 transitions. [2025-03-03 16:16:53,702 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1585 transitions. Word has length 28 [2025-03-03 16:16:53,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:53,702 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1585 transitions. [2025-03-03 16:16:53,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1585 transitions. [2025-03-03 16:16:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:16:53,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:53,704 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-03-03 16:16:53,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:16:53,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1041240174, now seen corresponding path program 1 times [2025-03-03 16:16:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:53,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97724081] [2025-03-03 16:16:53,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:53,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:16:53,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:16:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:53,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97724081] [2025-03-03 16:16:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97724081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:53,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041239735] [2025-03-03 16:16:53,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:53,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:16:53,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:53,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:16:53,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:16:53,882 INFO L87 Difference]: Start difference. First operand 866 states and 1585 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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-03-03 16:16:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:58,550 INFO L93 Difference]: Finished difference Result 3121 states and 5894 transitions. [2025-03-03 16:16:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:16:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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-03-03 16:16:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:58,560 INFO L225 Difference]: With dead ends: 3121 [2025-03-03 16:16:58,560 INFO L226 Difference]: Without dead ends: 2368 [2025-03-03 16:16:58,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:16:58,564 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 2471 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:58,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 839 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 16:16:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2025-03-03 16:16:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2025-03-03 16:16:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2366 states have (on average 1.5633981403212172) internal successors, (3699), 2367 states have internal predecessors, (3699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3699 transitions. [2025-03-03 16:16:58,609 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3699 transitions. Word has length 67 [2025-03-03 16:16:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:58,610 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3699 transitions. [2025-03-03 16:16:58,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 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-03-03 16:16:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3699 transitions. [2025-03-03 16:16:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:16:58,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:58,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:58,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:16:58,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:58,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1657211218, now seen corresponding path program 1 times [2025-03-03 16:16:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380723130] [2025-03-03 16:16:58,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:58,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:16:58,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:16:58,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:58,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380723130] [2025-03-03 16:16:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380723130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161248738] [2025-03-03 16:16:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:58,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:58,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:58,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:58,840 INFO L87 Difference]: Start difference. First operand 2368 states and 3699 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:59,218 INFO L93 Difference]: Finished difference Result 3152 states and 4959 transitions. [2025-03-03 16:16:59,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:16:59,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:16:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:59,227 INFO L225 Difference]: With dead ends: 3152 [2025-03-03 16:16:59,228 INFO L226 Difference]: Without dead ends: 3096 [2025-03-03 16:16:59,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:16:59,229 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 11538 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11538 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:59,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11538 Valid, 4683 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:16:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2025-03-03 16:16:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 2422. [2025-03-03 16:16:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2420 states have (on average 1.5644628099173554) internal successors, (3786), 2421 states have internal predecessors, (3786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3786 transitions. [2025-03-03 16:16:59,270 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3786 transitions. Word has length 77 [2025-03-03 16:16:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:59,271 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 3786 transitions. [2025-03-03 16:16:59,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3786 transitions. [2025-03-03 16:16:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:16:59,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:59,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:59,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:16:59,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:59,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1973239561, now seen corresponding path program 1 times [2025-03-03 16:16:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006363423] [2025-03-03 16:16:59,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:59,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:16:59,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:16:59,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:59,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:59,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:59,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006363423] [2025-03-03 16:16:59,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006363423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:59,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:59,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:16:59,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458968078] [2025-03-03 16:16:59,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:59,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:16:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:59,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:16:59,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:59,386 INFO L87 Difference]: Start difference. First operand 2422 states and 3786 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:16:59,413 INFO L93 Difference]: Finished difference Result 2631 states and 4121 transitions. [2025-03-03 16:16:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:16:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 16:16:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:16:59,423 INFO L225 Difference]: With dead ends: 2631 [2025-03-03 16:16:59,423 INFO L226 Difference]: Without dead ends: 2521 [2025-03-03 16:16:59,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:16:59,426 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1500 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:16:59,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1664 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:16:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-03-03 16:16:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2517. [2025-03-03 16:16:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.5650099403578528) internal successors, (3936), 2516 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3936 transitions. [2025-03-03 16:16:59,471 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3936 transitions. Word has length 79 [2025-03-03 16:16:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:16:59,471 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3936 transitions. [2025-03-03 16:16:59,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:16:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3936 transitions. [2025-03-03 16:16:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:16:59,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:16:59,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:16:59,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:16:59,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:16:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:16:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2005562796, now seen corresponding path program 1 times [2025-03-03 16:16:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:16:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798791930] [2025-03-03 16:16:59,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:16:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:16:59,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:16:59,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:16:59,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:16:59,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:16:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:16:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:16:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798791930] [2025-03-03 16:16:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798791930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:16:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:16:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:16:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085535111] [2025-03-03 16:16:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:16:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:16:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:16:59,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:16:59,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:16:59,827 INFO L87 Difference]: Start difference. First operand 2517 states and 3936 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:00,067 INFO L93 Difference]: Finished difference Result 2724 states and 4264 transitions. [2025-03-03 16:17:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:17:00,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 16:17:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:00,074 INFO L225 Difference]: With dead ends: 2724 [2025-03-03 16:17:00,075 INFO L226 Difference]: Without dead ends: 2519 [2025-03-03 16:17:00,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-03 16:17:00,076 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 10574 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10574 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:00,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10574 Valid, 2099 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2025-03-03 16:17:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2517. [2025-03-03 16:17:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.5642147117296223) internal successors, (3934), 2516 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3934 transitions. [2025-03-03 16:17:00,110 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3934 transitions. Word has length 79 [2025-03-03 16:17:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3934 transitions. [2025-03-03 16:17:00,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3934 transitions. [2025-03-03 16:17:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 16:17:00,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:00,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:00,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:17:00,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:00,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2073442266, now seen corresponding path program 1 times [2025-03-03 16:17:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:00,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805790937] [2025-03-03 16:17:00,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:00,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 16:17:00,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 16:17:00,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:00,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:00,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:00,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805790937] [2025-03-03 16:17:00,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805790937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:17:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117942558] [2025-03-03 16:17:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:00,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:17:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:00,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:17:00,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:17:00,322 INFO L87 Difference]: Start difference. First operand 2517 states and 3934 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:00,369 INFO L93 Difference]: Finished difference Result 2525 states and 3943 transitions. [2025-03-03 16:17:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:17:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 16:17:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:00,376 INFO L225 Difference]: With dead ends: 2525 [2025-03-03 16:17:00,376 INFO L226 Difference]: Without dead ends: 2523 [2025-03-03 16:17:00,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:17:00,378 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 0 mSDsluCounter, 9461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11040 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:00,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11040 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2025-03-03 16:17:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2523. [2025-03-03 16:17:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2521 states have (on average 1.562475208250694) internal successors, (3939), 2522 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3939 transitions. [2025-03-03 16:17:00,416 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3939 transitions. Word has length 80 [2025-03-03 16:17:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:00,416 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 3939 transitions. [2025-03-03 16:17:00,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3939 transitions. [2025-03-03 16:17:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:17:00,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:00,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:00,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:17:00,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -607984566, now seen corresponding path program 1 times [2025-03-03 16:17:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974340874] [2025-03-03 16:17:00,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:00,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:17:00,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:17:00,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:00,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:00,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:00,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974340874] [2025-03-03 16:17:00,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974340874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:00,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:00,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947273643] [2025-03-03 16:17:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:00,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:00,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:00,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:00,490 INFO L87 Difference]: Start difference. First operand 2523 states and 3939 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:00,513 INFO L93 Difference]: Finished difference Result 2929 states and 4571 transitions. [2025-03-03 16:17:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:17:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:00,521 INFO L225 Difference]: With dead ends: 2929 [2025-03-03 16:17:00,521 INFO L226 Difference]: Without dead ends: 2718 [2025-03-03 16:17:00,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:00,522 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1517 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:00,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2025-03-03 16:17:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2716. [2025-03-03 16:17:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2714 states have (on average 1.5607958732498157) internal successors, (4236), 2715 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 4236 transitions. [2025-03-03 16:17:00,560 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 4236 transitions. Word has length 81 [2025-03-03 16:17:00,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:00,561 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 4236 transitions. [2025-03-03 16:17:00,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 4236 transitions. [2025-03-03 16:17:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:17:00,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:00,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:00,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:17:00,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:00,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash -762353398, now seen corresponding path program 1 times [2025-03-03 16:17:00,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:00,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61863340] [2025-03-03 16:17:00,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:00,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:00,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:17:00,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:17:00,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:00,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61863340] [2025-03-03 16:17:00,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61863340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:00,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:00,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:00,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760401012] [2025-03-03 16:17:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:00,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:00,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:00,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:00,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:00,613 INFO L87 Difference]: Start difference. First operand 2716 states and 4236 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:00,645 INFO L93 Difference]: Finished difference Result 3492 states and 5434 transitions. [2025-03-03 16:17:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:17:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:00,654 INFO L225 Difference]: With dead ends: 3492 [2025-03-03 16:17:00,654 INFO L226 Difference]: Without dead ends: 3088 [2025-03-03 16:17:00,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:00,656 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1515 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:00,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:00,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2025-03-03 16:17:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3086. [2025-03-03 16:17:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 3084 states have (on average 1.5557717250324254) internal successors, (4798), 3085 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4798 transitions. [2025-03-03 16:17:00,708 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4798 transitions. Word has length 81 [2025-03-03 16:17:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:00,709 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 4798 transitions. [2025-03-03 16:17:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4798 transitions. [2025-03-03 16:17:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:17:00,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:00,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:00,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:17:00,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:00,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:00,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1741283894, now seen corresponding path program 1 times [2025-03-03 16:17:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809560780] [2025-03-03 16:17:00,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:00,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:17:00,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:17:00,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:00,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809560780] [2025-03-03 16:17:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809560780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:00,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23465827] [2025-03-03 16:17:00,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:00,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:00,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:00,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:00,761 INFO L87 Difference]: Start difference. First operand 3086 states and 4798 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:00,793 INFO L93 Difference]: Finished difference Result 4570 states and 7064 transitions. [2025-03-03 16:17:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:17:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:00,812 INFO L225 Difference]: With dead ends: 4570 [2025-03-03 16:17:00,812 INFO L226 Difference]: Without dead ends: 3796 [2025-03-03 16:17:00,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:00,817 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1513 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:00,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1751 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2025-03-03 16:17:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3794. [2025-03-03 16:17:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3792 states have (on average 1.544831223628692) internal successors, (5858), 3793 states have internal predecessors, (5858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5858 transitions. [2025-03-03 16:17:00,885 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5858 transitions. Word has length 81 [2025-03-03 16:17:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:00,885 INFO L471 AbstractCegarLoop]: Abstraction has 3794 states and 5858 transitions. [2025-03-03 16:17:00,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5858 transitions. [2025-03-03 16:17:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:17:00,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:00,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:00,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:17:00,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:00,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2105737866, now seen corresponding path program 1 times [2025-03-03 16:17:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667606017] [2025-03-03 16:17:00,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:00,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:17:00,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:17:00,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:00,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667606017] [2025-03-03 16:17:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667606017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:00,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345534394] [2025-03-03 16:17:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:00,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:00,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:00,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:00,972 INFO L87 Difference]: Start difference. First operand 3794 states and 5858 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:01,037 INFO L93 Difference]: Finished difference Result 6630 states and 10132 transitions. [2025-03-03 16:17:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:17:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:01,054 INFO L225 Difference]: With dead ends: 6630 [2025-03-03 16:17:01,054 INFO L226 Difference]: Without dead ends: 5148 [2025-03-03 16:17:01,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:01,066 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1511 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:01,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1753 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2025-03-03 16:17:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 5146. [2025-03-03 16:17:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5144 states have (on average 1.526049766718507) internal successors, (7850), 5145 states have internal predecessors, (7850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 7850 transitions. [2025-03-03 16:17:01,247 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 7850 transitions. Word has length 81 [2025-03-03 16:17:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:01,247 INFO L471 AbstractCegarLoop]: Abstraction has 5146 states and 7850 transitions. [2025-03-03 16:17:01,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 7850 transitions. [2025-03-03 16:17:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:17:01,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:01,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:01,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:17:01,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1774053558, now seen corresponding path program 1 times [2025-03-03 16:17:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484066968] [2025-03-03 16:17:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:01,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:17:01,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:17:01,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:01,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484066968] [2025-03-03 16:17:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484066968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:01,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:01,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563168866] [2025-03-03 16:17:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:01,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:01,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:01,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:01,295 INFO L87 Difference]: Start difference. First operand 5146 states and 7850 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:01,366 INFO L93 Difference]: Finished difference Result 10558 states and 15884 transitions. [2025-03-03 16:17:01,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:01,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:17:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:01,380 INFO L225 Difference]: With dead ends: 10558 [2025-03-03 16:17:01,380 INFO L226 Difference]: Without dead ends: 7724 [2025-03-03 16:17:01,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:01,387 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1509 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:01,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1755 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:01,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2025-03-03 16:17:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7722. [2025-03-03 16:17:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7722 states, 7720 states have (on average 1.499740932642487) internal successors, (11578), 7721 states have internal predecessors, (11578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7722 states to 7722 states and 11578 transitions. [2025-03-03 16:17:01,571 INFO L78 Accepts]: Start accepts. Automaton has 7722 states and 11578 transitions. Word has length 81 [2025-03-03 16:17:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:01,571 INFO L471 AbstractCegarLoop]: Abstraction has 7722 states and 11578 transitions. [2025-03-03 16:17:01,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7722 states and 11578 transitions. [2025-03-03 16:17:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 16:17:01,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:01,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:01,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:17:01,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:01,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2034195466, now seen corresponding path program 1 times [2025-03-03 16:17:01,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:01,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81931793] [2025-03-03 16:17:01,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:01,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 16:17:01,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 16:17:01,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:01,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:01,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81931793] [2025-03-03 16:17:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81931793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:01,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982967564] [2025-03-03 16:17:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:01,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:01,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:01,615 INFO L87 Difference]: Start difference. First operand 7722 states and 11578 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:01,722 INFO L93 Difference]: Finished difference Result 18030 states and 26620 transitions. [2025-03-03 16:17:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:01,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 16:17:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:01,743 INFO L225 Difference]: With dead ends: 18030 [2025-03-03 16:17:01,743 INFO L226 Difference]: Without dead ends: 12620 [2025-03-03 16:17:01,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-03-03 16:17:01,752 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1507 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:01,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1757 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12620 states. [2025-03-03 16:17:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12620 to 12618. [2025-03-03 16:17:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 12616 states have (on average 1.4681357006975269) internal successors, (18522), 12617 states have internal predecessors, (18522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 18522 transitions. [2025-03-03 16:17:02,094 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 18522 transitions. Word has length 81 [2025-03-03 16:17:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:02,094 INFO L471 AbstractCegarLoop]: Abstraction has 12618 states and 18522 transitions. [2025-03-03 16:17:02,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 18522 transitions. [2025-03-03 16:17:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 16:17:02,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:02,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:17:02,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:17:02,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:02,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:02,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1506966134, now seen corresponding path program 1 times [2025-03-03 16:17:02,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:02,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587749174] [2025-03-03 16:17:02,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:02,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:02,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 16:17:02,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 16:17:02,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:02,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:17:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587749174] [2025-03-03 16:17:02,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587749174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:02,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:02,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:17:02,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744727662] [2025-03-03 16:17:02,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:02,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:17:02,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:02,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:17:02,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:02,152 INFO L87 Difference]: Start difference. First operand 12618 states and 18522 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:02,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:02,371 INFO L93 Difference]: Finished difference Result 23377 states and 34272 transitions. [2025-03-03 16:17:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:17:02,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 16:17:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:02,400 INFO L225 Difference]: With dead ends: 23377 [2025-03-03 16:17:02,400 INFO L226 Difference]: Without dead ends: 17614 [2025-03-03 16:17:02,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:17:02,412 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1516 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:02,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:17:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17614 states. [2025-03-03 16:17:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17614 to 17612. [2025-03-03 16:17:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17612 states, 17610 states have (on average 1.4553094832481546) internal successors, (25628), 17611 states have internal predecessors, (25628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17612 states to 17612 states and 25628 transitions. [2025-03-03 16:17:02,758 INFO L78 Accepts]: Start accepts. Automaton has 17612 states and 25628 transitions. Word has length 83 [2025-03-03 16:17:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:02,759 INFO L471 AbstractCegarLoop]: Abstraction has 17612 states and 25628 transitions. [2025-03-03 16:17:02,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 17612 states and 25628 transitions. [2025-03-03 16:17:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:17:02,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:02,763 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, 1, 1, 1, 1, 1] [2025-03-03 16:17:02,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:17:02,764 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 113999974, now seen corresponding path program 1 times [2025-03-03 16:17:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382388524] [2025-03-03 16:17:02,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:02,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:17:02,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:17:02,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:02,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:17:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:02,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382388524] [2025-03-03 16:17:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382388524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:02,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:17:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056276355] [2025-03-03 16:17:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:02,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:17:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:02,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:17:02,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:17:02,938 INFO L87 Difference]: Start difference. First operand 17612 states and 25628 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:04,393 INFO L93 Difference]: Finished difference Result 127836 states and 184100 transitions. [2025-03-03 16:17:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:17:04,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 104 [2025-03-03 16:17:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:04,591 INFO L225 Difference]: With dead ends: 127836 [2025-03-03 16:17:04,591 INFO L226 Difference]: Without dead ends: 112538 [2025-03-03 16:17:04,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:17:04,629 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 9830 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9830 SdHoareTripleChecker+Valid, 4601 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:04,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9830 Valid, 4601 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112538 states. [2025-03-03 16:17:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112538 to 32908. [2025-03-03 16:17:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32908 states, 32906 states have (on average 1.4420470430924452) internal successors, (47452), 32907 states have internal predecessors, (47452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32908 states to 32908 states and 47452 transitions. [2025-03-03 16:17:06,068 INFO L78 Accepts]: Start accepts. Automaton has 32908 states and 47452 transitions. Word has length 104 [2025-03-03 16:17:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:06,068 INFO L471 AbstractCegarLoop]: Abstraction has 32908 states and 47452 transitions. [2025-03-03 16:17:06,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32908 states and 47452 transitions. [2025-03-03 16:17:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:17:06,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:06,073 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, 1, 1, 1, 1, 1] [2025-03-03 16:17:06,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:17:06,073 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -40368858, now seen corresponding path program 1 times [2025-03-03 16:17:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053177195] [2025-03-03 16:17:06,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:06,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:17:06,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:17:06,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:17:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053177195] [2025-03-03 16:17:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053177195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:06,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:17:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344517971] [2025-03-03 16:17:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:06,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:17:06,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:06,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:17:06,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:17:06,235 INFO L87 Difference]: Start difference. First operand 32908 states and 47452 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 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-03-03 16:17:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:07,979 INFO L93 Difference]: Finished difference Result 143132 states and 205924 transitions. [2025-03-03 16:17:07,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:17:07,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 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 104 [2025-03-03 16:17:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:08,156 INFO L225 Difference]: With dead ends: 143132 [2025-03-03 16:17:08,156 INFO L226 Difference]: Without dead ends: 127834 [2025-03-03 16:17:08,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:17:08,188 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 9851 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9851 SdHoareTripleChecker+Valid, 4497 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:08,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9851 Valid, 4497 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127834 states. [2025-03-03 16:17:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127834 to 55884. [2025-03-03 16:17:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55884 states, 55882 states have (on average 1.4320890447729144) internal successors, (80028), 55883 states have internal predecessors, (80028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55884 states to 55884 states and 80028 transitions. [2025-03-03 16:17:10,168 INFO L78 Accepts]: Start accepts. Automaton has 55884 states and 80028 transitions. Word has length 104 [2025-03-03 16:17:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:10,169 INFO L471 AbstractCegarLoop]: Abstraction has 55884 states and 80028 transitions. [2025-03-03 16:17:10,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 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-03-03 16:17:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 55884 states and 80028 transitions. [2025-03-03 16:17:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:17:10,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:10,175 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, 1, 1, 1, 1, 1] [2025-03-03 16:17:10,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:17:10,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:10,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1019299354, now seen corresponding path program 1 times [2025-03-03 16:17:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:10,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542450788] [2025-03-03 16:17:10,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:10,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:17:10,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:17:10,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:10,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:17:10,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542450788] [2025-03-03 16:17:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542450788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:17:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655903889] [2025-03-03 16:17:10,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:10,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:17:10,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:10,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:17:10,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:17:10,371 INFO L87 Difference]: Start difference. First operand 55884 states and 80028 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 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-03-03 16:17:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:12,884 INFO L93 Difference]: Finished difference Result 158428 states and 227748 transitions. [2025-03-03 16:17:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:17:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 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 104 [2025-03-03 16:17:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:13,090 INFO L225 Difference]: With dead ends: 158428 [2025-03-03 16:17:13,090 INFO L226 Difference]: Without dead ends: 143130 [2025-03-03 16:17:13,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:17:13,140 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 9896 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9896 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:13,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9896 Valid, 4390 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143130 states. [2025-03-03 16:17:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143130 to 71180. [2025-03-03 16:17:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71180 states, 71178 states have (on average 1.4309477647587738) internal successors, (101852), 71179 states have internal predecessors, (101852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71180 states to 71180 states and 101852 transitions. [2025-03-03 16:17:15,758 INFO L78 Accepts]: Start accepts. Automaton has 71180 states and 101852 transitions. Word has length 104 [2025-03-03 16:17:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:15,758 INFO L471 AbstractCegarLoop]: Abstraction has 71180 states and 101852 transitions. [2025-03-03 16:17:15,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 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-03-03 16:17:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 71180 states and 101852 transitions. [2025-03-03 16:17:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:17:15,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:15,765 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, 1, 1, 1, 1, 1] [2025-03-03 16:17:15,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:17:15,765 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1467244890, now seen corresponding path program 1 times [2025-03-03 16:17:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468400455] [2025-03-03 16:17:15,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:15,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:17:15,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:17:15,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:15,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:17:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468400455] [2025-03-03 16:17:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468400455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:15,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:15,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:17:15,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446079894] [2025-03-03 16:17:15,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:15,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:17:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:15,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:17:15,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:17:15,969 INFO L87 Difference]: Start difference. First operand 71180 states and 101852 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:18,990 INFO L93 Difference]: Finished difference Result 173724 states and 249572 transitions. [2025-03-03 16:17:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:17:18,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-03 16:17:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:19,180 INFO L225 Difference]: With dead ends: 173724 [2025-03-03 16:17:19,180 INFO L226 Difference]: Without dead ends: 158426 [2025-03-03 16:17:19,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:17:19,221 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9946 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9946 SdHoareTripleChecker+Valid, 4356 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:19,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9946 Valid, 4356 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158426 states. [2025-03-03 16:17:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158426 to 86476. [2025-03-03 16:17:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86476 states, 86474 states have (on average 1.4302102366029095) internal successors, (123676), 86475 states have internal predecessors, (123676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86476 states to 86476 states and 123676 transitions. [2025-03-03 16:17:22,356 INFO L78 Accepts]: Start accepts. Automaton has 86476 states and 123676 transitions. Word has length 104 [2025-03-03 16:17:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:22,356 INFO L471 AbstractCegarLoop]: Abstraction has 86476 states and 123676 transitions. [2025-03-03 16:17:22,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 86476 states and 123676 transitions. [2025-03-03 16:17:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:17:22,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:22,362 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, 1, 1, 1, 1, 1] [2025-03-03 16:17:22,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:17:22,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:22,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:22,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1052069018, now seen corresponding path program 1 times [2025-03-03 16:17:22,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:22,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437251575] [2025-03-03 16:17:22,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:22,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:22,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:17:22,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:17:22,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:22,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 16:17:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437251575] [2025-03-03 16:17:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437251575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:17:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317222187] [2025-03-03 16:17:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:17:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:22,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:17:22,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:17:22,560 INFO L87 Difference]: Start difference. First operand 86476 states and 123676 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:17:25,805 INFO L93 Difference]: Finished difference Result 189020 states and 271396 transitions. [2025-03-03 16:17:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:17:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 104 [2025-03-03 16:17:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:17:26,055 INFO L225 Difference]: With dead ends: 189020 [2025-03-03 16:17:26,055 INFO L226 Difference]: Without dead ends: 173722 [2025-03-03 16:17:26,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:17:26,116 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 10005 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10005 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:17:26,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10005 Valid, 4389 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:17:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173722 states. [2025-03-03 16:17:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173722 to 101772. [2025-03-03 16:17:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101772 states, 101770 states have (on average 1.4296944089613834) internal successors, (145500), 101771 states have internal predecessors, (145500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101772 states to 101772 states and 145500 transitions. [2025-03-03 16:17:28,952 INFO L78 Accepts]: Start accepts. Automaton has 101772 states and 145500 transitions. Word has length 104 [2025-03-03 16:17:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:17:28,953 INFO L471 AbstractCegarLoop]: Abstraction has 101772 states and 145500 transitions. [2025-03-03 16:17:28,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:17:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 101772 states and 145500 transitions. [2025-03-03 16:17:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:17:28,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:17:28,957 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, 1, 1, 1, 1, 1] [2025-03-03 16:17:28,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:17:28,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:17:28,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:17:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1538787290, now seen corresponding path program 1 times [2025-03-03 16:17:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:17:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552516297] [2025-03-03 16:17:28,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:17:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:17:28,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:17:28,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:17:28,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:17:28,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:17:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 16:17:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:17:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552516297] [2025-03-03 16:17:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552516297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:17:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:17:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 16:17:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169366123] [2025-03-03 16:17:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:17:29,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 16:17:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:17:29,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 16:17:29,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:17:29,282 INFO L87 Difference]: Start difference. First operand 101772 states and 145500 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)