./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.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 afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:22:06,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:22:06,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:22:06,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:22:06,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:22:06,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:22:06,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:22:06,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:22:06,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:22:06,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:22:06,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:22:06,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:22:06,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:22:06,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:22:06,976 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:22:06,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:22:06,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:22:06,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:22:06,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:22:06,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:22:06,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:22:06,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:22:06,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:22:06,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:22:06,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:22:06,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:22:06,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:22:06,979 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 -> afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 [2025-03-08 06:22:07,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:22:07,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:22:07,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:22:07,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:22:07,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:22:07,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-08 06:22:08,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c74d43c/4cc4c0f80fac4dae9a25e8ff3f46f9a6/FLAGfc58fd5ea [2025-03-08 06:22:08,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:22:08,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-08 06:22:08,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c74d43c/4cc4c0f80fac4dae9a25e8ff3f46f9a6/FLAGfc58fd5ea [2025-03-08 06:22:08,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c74d43c/4cc4c0f80fac4dae9a25e8ff3f46f9a6 [2025-03-08 06:22:08,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:22:08,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:22:08,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:22:08,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:22:08,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:22:08,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:08" (1/1) ... [2025-03-08 06:22:08,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:08, skipping insertion in model container [2025-03-08 06:22:08,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:22:08" (1/1) ... [2025-03-08 06:22:08,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:22:08,952 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2025-03-08 06:22:08,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:22:08,983 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:22:09,011 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2025-03-08 06:22:09,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:22:09,042 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:22:09,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09 WrapperNode [2025-03-08 06:22:09,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:22:09,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:22:09,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:22:09,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:22:09,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,080 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 296 [2025-03-08 06:22:09,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:22:09,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:22:09,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:22:09,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:22:09,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:22:09,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:22:09,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:22:09,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:22:09,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:22:09,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (1/1) ... [2025-03-08 06:22:09,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:22:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:09,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:22:09,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:22:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:22:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:22:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:22:09,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:22:09,241 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:22:09,242 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:22:09,501 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:22:09,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:22:09,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:22:09,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L354: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:22:09,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc main_~node3__m3~0#1; [2025-03-08 06:22:09,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: havoc main_~node2__m2~0#1; [2025-03-08 06:22:09,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:22:09,515 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 06:22:09,515 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:22:09,522 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:22:09,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:22:09,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:09 BoogieIcfgContainer [2025-03-08 06:22:09,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:22:09,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:22:09,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:22:09,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:22:09,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:22:08" (1/3) ... [2025-03-08 06:22:09,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a91800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:09, skipping insertion in model container [2025-03-08 06:22:09,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:22:09" (2/3) ... [2025-03-08 06:22:09,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a91800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:22:09, skipping insertion in model container [2025-03-08 06:22:09,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:22:09" (3/3) ... [2025-03-08 06:22:09,532 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-08 06:22:09,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:22:09,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 62 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:22:09,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:22:09,602 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;@4f2e6afb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:22:09,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:22:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 06:22:09,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:09,610 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] [2025-03-08 06:22:09,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:09,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1946824725, now seen corresponding path program 1 times [2025-03-08 06:22:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445658616] [2025-03-08 06:22:09,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:09,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 06:22:09,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 06:22:09,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:09,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:09,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:09,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445658616] [2025-03-08 06:22:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445658616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:09,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397572251] [2025-03-08 06:22:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:09,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:09,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:09,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:09,915 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:09,952 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2025-03-08 06:22:09,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-08 06:22:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:09,962 INFO L225 Difference]: With dead ends: 140 [2025-03-08 06:22:09,962 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 06:22:09,965 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-08 06:22:09,968 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:09,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 06:22:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-08 06:22:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2025-03-08 06:22:09,997 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 36 [2025-03-08 06:22:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:09,998 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2025-03-08 06:22:09,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2025-03-08 06:22:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 06:22:09,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:09,999 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] [2025-03-08 06:22:09,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:22:09,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 488759384, now seen corresponding path program 1 times [2025-03-08 06:22:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392972071] [2025-03-08 06:22:10,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:10,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 06:22:10,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 06:22:10,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:10,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:10,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:10,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392972071] [2025-03-08 06:22:10,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392972071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:10,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:10,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:10,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384704501] [2025-03-08 06:22:10,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:10,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:10,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:10,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:10,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:10,141 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:10,162 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2025-03-08 06:22:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:10,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-08 06:22:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:10,165 INFO L225 Difference]: With dead ends: 213 [2025-03-08 06:22:10,165 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 06:22:10,166 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-08 06:22:10,166 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:10,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 06:22:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-03-08 06:22:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2025-03-08 06:22:10,182 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 37 [2025-03-08 06:22:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2025-03-08 06:22:10,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2025-03-08 06:22:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 06:22:10,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:10,183 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] [2025-03-08 06:22:10,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:22:10,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:10,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -851060552, now seen corresponding path program 1 times [2025-03-08 06:22:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342644659] [2025-03-08 06:22:10,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:10,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 06:22:10,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 06:22:10,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:10,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342644659] [2025-03-08 06:22:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342644659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:10,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776645934] [2025-03-08 06:22:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:10,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:10,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:10,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:10,260 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:10,279 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2025-03-08 06:22:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:10,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 06:22:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:10,281 INFO L225 Difference]: With dead ends: 353 [2025-03-08 06:22:10,281 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 06:22:10,282 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-08 06:22:10,282 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:10,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 06:22:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2025-03-08 06:22:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2025-03-08 06:22:10,294 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 38 [2025-03-08 06:22:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:10,295 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2025-03-08 06:22:10,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2025-03-08 06:22:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 06:22:10,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:10,295 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] [2025-03-08 06:22:10,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:22:10,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:10,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1172145669, now seen corresponding path program 1 times [2025-03-08 06:22:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854020151] [2025-03-08 06:22:10,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:10,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 06:22:10,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 06:22:10,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:10,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:10,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854020151] [2025-03-08 06:22:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854020151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:10,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:10,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000384303] [2025-03-08 06:22:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:10,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:10,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:10,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:10,421 INFO L87 Difference]: Start difference. First operand 229 states and 348 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:10,525 INFO L93 Difference]: Finished difference Result 1489 states and 2322 transitions. [2025-03-08 06:22:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:22:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-08 06:22:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:10,532 INFO L225 Difference]: With dead ends: 1489 [2025-03-08 06:22:10,532 INFO L226 Difference]: Without dead ends: 1279 [2025-03-08 06:22:10,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:22:10,536 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 374 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:10,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 535 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:22:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2025-03-08 06:22:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 437. [2025-03-08 06:22:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2025-03-08 06:22:10,570 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 39 [2025-03-08 06:22:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:10,571 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 660 transitions. [2025-03-08 06:22:10,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 660 transitions. [2025-03-08 06:22:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 06:22:10,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:10,571 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] [2025-03-08 06:22:10,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:22:10,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:10,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1189439790, now seen corresponding path program 1 times [2025-03-08 06:22:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33834244] [2025-03-08 06:22:10,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:10,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 06:22:10,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 06:22:10,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:10,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33834244] [2025-03-08 06:22:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33834244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:10,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668949936] [2025-03-08 06:22:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:10,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:10,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:10,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:10,669 INFO L87 Difference]: Start difference. First operand 437 states and 660 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:10,691 INFO L93 Difference]: Finished difference Result 1055 states and 1604 transitions. [2025-03-08 06:22:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-08 06:22:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:10,694 INFO L225 Difference]: With dead ends: 1055 [2025-03-08 06:22:10,695 INFO L226 Difference]: Without dead ends: 637 [2025-03-08 06:22:10,695 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-08 06:22:10,697 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:10,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-08 06:22:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2025-03-08 06:22:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 950 transitions. [2025-03-08 06:22:10,718 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 950 transitions. Word has length 41 [2025-03-08 06:22:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:10,718 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 950 transitions. [2025-03-08 06:22:10,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 950 transitions. [2025-03-08 06:22:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 06:22:10,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:10,719 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] [2025-03-08 06:22:10,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:22:10,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:10,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1190601639, now seen corresponding path program 1 times [2025-03-08 06:22:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:10,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387199807] [2025-03-08 06:22:10,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:10,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:10,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 06:22:10,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 06:22:10,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:10,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:10,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387199807] [2025-03-08 06:22:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387199807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:10,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:10,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166557519] [2025-03-08 06:22:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:10,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:10,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:10,912 INFO L87 Difference]: Start difference. First operand 635 states and 950 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:10,975 INFO L93 Difference]: Finished difference Result 1251 states and 1880 transitions. [2025-03-08 06:22:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-08 06:22:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:10,979 INFO L225 Difference]: With dead ends: 1251 [2025-03-08 06:22:10,979 INFO L226 Difference]: Without dead ends: 637 [2025-03-08 06:22:10,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:22:10,981 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:10,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 195 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-08 06:22:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2025-03-08 06:22:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 938 transitions. [2025-03-08 06:22:11,010 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 938 transitions. Word has length 41 [2025-03-08 06:22:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:11,011 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 938 transitions. [2025-03-08 06:22:11,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 938 transitions. [2025-03-08 06:22:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 06:22:11,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:11,012 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] [2025-03-08 06:22:11,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:22:11,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:11,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1745099488, now seen corresponding path program 1 times [2025-03-08 06:22:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:11,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-03-08 06:22:11,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:11,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 06:22:11,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 06:22:11,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:11,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:11,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:11,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-03-08 06:22:11,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071892848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:11,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:11,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:11,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10118429] [2025-03-08 06:22:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:11,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:11,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:11,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:11,217 INFO L87 Difference]: Start difference. First operand 635 states and 938 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:11,241 INFO L93 Difference]: Finished difference Result 669 states and 987 transitions. [2025-03-08 06:22:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:11,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-08 06:22:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:11,243 INFO L225 Difference]: With dead ends: 669 [2025-03-08 06:22:11,244 INFO L226 Difference]: Without dead ends: 667 [2025-03-08 06:22:11,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:11,245 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:11,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-08 06:22:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-03-08 06:22:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.4504504504504505) internal successors, (966), 666 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 966 transitions. [2025-03-08 06:22:11,264 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 966 transitions. Word has length 42 [2025-03-08 06:22:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:11,264 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 966 transitions. [2025-03-08 06:22:11,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 966 transitions. [2025-03-08 06:22:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:22:11,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:11,265 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:11,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:22:11,265 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 208880481, now seen corresponding path program 1 times [2025-03-08 06:22:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:11,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274927039] [2025-03-08 06:22:11,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:11,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:22:11,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:22:11,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:11,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:22:11,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:11,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274927039] [2025-03-08 06:22:11,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274927039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:11,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381427620] [2025-03-08 06:22:11,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:11,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:11,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:11,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:11,369 INFO L87 Difference]: Start difference. First operand 667 states and 966 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:11,439 INFO L93 Difference]: Finished difference Result 2539 states and 3698 transitions. [2025-03-08 06:22:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 06:22:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:11,446 INFO L225 Difference]: With dead ends: 2539 [2025-03-08 06:22:11,446 INFO L226 Difference]: Without dead ends: 2089 [2025-03-08 06:22:11,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:22:11,448 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 209 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:11,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 385 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-08 06:22:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1215. [2025-03-08 06:22:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.4481054365733115) internal successors, (1758), 1214 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1758 transitions. [2025-03-08 06:22:11,483 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1758 transitions. Word has length 60 [2025-03-08 06:22:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:11,483 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1758 transitions. [2025-03-08 06:22:11,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1758 transitions. [2025-03-08 06:22:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:22:11,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:11,486 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:22:11,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1934366975, now seen corresponding path program 1 times [2025-03-08 06:22:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608036508] [2025-03-08 06:22:11,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:11,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:22:11,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:22:11,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:11,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:22:11,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:11,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608036508] [2025-03-08 06:22:11,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608036508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:11,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:11,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982806686] [2025-03-08 06:22:11,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:11,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:11,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:11,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:11,618 INFO L87 Difference]: Start difference. First operand 1215 states and 1758 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:11,698 INFO L93 Difference]: Finished difference Result 3183 states and 4634 transitions. [2025-03-08 06:22:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 06:22:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:11,707 INFO L225 Difference]: With dead ends: 3183 [2025-03-08 06:22:11,707 INFO L226 Difference]: Without dead ends: 2537 [2025-03-08 06:22:11,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:22:11,711 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 210 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:11,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 366 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-03-08 06:22:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2083. [2025-03-08 06:22:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2082 states have (on average 1.445725264169068) internal successors, (3010), 2082 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3010 transitions. [2025-03-08 06:22:11,760 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3010 transitions. Word has length 60 [2025-03-08 06:22:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:11,760 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3010 transitions. [2025-03-08 06:22:11,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3010 transitions. [2025-03-08 06:22:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:22:11,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:11,761 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:11,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:22:11,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:11,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1726522719, now seen corresponding path program 1 times [2025-03-08 06:22:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393914616] [2025-03-08 06:22:11,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:11,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:22:11,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:22:11,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:11,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:22:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:11,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393914616] [2025-03-08 06:22:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393914616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:22:11,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361028021] [2025-03-08 06:22:11,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:11,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:22:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:11,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:22:11,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:22:11,845 INFO L87 Difference]: Start difference. First operand 2083 states and 3010 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:11,909 INFO L93 Difference]: Finished difference Result 3827 states and 5566 transitions. [2025-03-08 06:22:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:22:11,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 06:22:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:11,918 INFO L225 Difference]: With dead ends: 3827 [2025-03-08 06:22:11,918 INFO L226 Difference]: Without dead ends: 3181 [2025-03-08 06:22:11,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:22:11,920 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 215 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:11,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 371 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2025-03-08 06:22:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2727. [2025-03-08 06:22:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 1.446074834922964) internal successors, (3942), 2726 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 3942 transitions. [2025-03-08 06:22:11,961 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 3942 transitions. Word has length 60 [2025-03-08 06:22:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:11,961 INFO L471 AbstractCegarLoop]: Abstraction has 2727 states and 3942 transitions. [2025-03-08 06:22:11,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3942 transitions. [2025-03-08 06:22:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 06:22:11,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:11,962 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:11,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:22:11,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:11,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1147147911, now seen corresponding path program 1 times [2025-03-08 06:22:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:11,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-03-08 06:22:11,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:11,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:11,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 06:22:11,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 06:22:11,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:11,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-03-08 06:22:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408619316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:22:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071377468] [2025-03-08 06:22:12,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:12,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:12,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:12,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:22:12,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:22:12,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 06:22:12,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 06:22:12,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:12,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:12,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 06:22:12,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:22:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:12,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:22:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071377468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:22:12,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:22:12,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2025-03-08 06:22:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470126611] [2025-03-08 06:22:12,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:22:12,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 06:22:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:12,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 06:22:12,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:22:12,838 INFO L87 Difference]: Start difference. First operand 2727 states and 3942 transitions. Second operand has 18 states, 18 states have (on average 9.61111111111111) internal successors, (173), 18 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:15,844 INFO L93 Difference]: Finished difference Result 27774 states and 39986 transitions. [2025-03-08 06:22:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-08 06:22:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.61111111111111) internal successors, (173), 18 states have internal predecessors, (173), 0 states have call successors, (0), 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 61 [2025-03-08 06:22:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:15,900 INFO L225 Difference]: With dead ends: 27774 [2025-03-08 06:22:15,900 INFO L226 Difference]: Without dead ends: 24748 [2025-03-08 06:22:15,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4993 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2003, Invalid=10879, Unknown=0, NotChecked=0, Total=12882 [2025-03-08 06:22:15,908 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 3643 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3643 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:15,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3643 Valid, 1039 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:22:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24748 states. [2025-03-08 06:22:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24748 to 20507. [2025-03-08 06:22:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20507 states, 20506 states have (on average 1.409684970252609) internal successors, (28907), 20506 states have internal predecessors, (28907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20507 states to 20507 states and 28907 transitions. [2025-03-08 06:22:16,293 INFO L78 Accepts]: Start accepts. Automaton has 20507 states and 28907 transitions. Word has length 61 [2025-03-08 06:22:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:16,293 INFO L471 AbstractCegarLoop]: Abstraction has 20507 states and 28907 transitions. [2025-03-08 06:22:16,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.61111111111111) internal successors, (173), 18 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 20507 states and 28907 transitions. [2025-03-08 06:22:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:22:16,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:16,295 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:16,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:22:16,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 06:22:16,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1722963677, now seen corresponding path program 1 times [2025-03-08 06:22:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-03-08 06:22:16,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:22:16,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:22:16,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:16,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:16,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:16,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-03-08 06:22:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825343523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:22:16,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472726835] [2025-03-08 06:22:16,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:16,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:16,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:16,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:22:16,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:22:16,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:22:16,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:22:16,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:16,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:16,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 06:22:16,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:22:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:17,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:22:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472726835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:22:18,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:22:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-08 06:22:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100280566] [2025-03-08 06:22:18,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:22:18,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:22:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:18,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:22:18,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:22:18,126 INFO L87 Difference]: Start difference. First operand 20507 states and 28907 transitions. Second operand has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:35,508 INFO L93 Difference]: Finished difference Result 633999 states and 892818 transitions. [2025-03-08 06:22:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2025-03-08 06:22:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-08 06:22:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:36,959 INFO L225 Difference]: With dead ends: 633999 [2025-03-08 06:22:36,959 INFO L226 Difference]: Without dead ends: 613513 [2025-03-08 06:22:37,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84839 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19897, Invalid=163715, Unknown=0, NotChecked=0, Total=183612 [2025-03-08 06:22:37,129 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 9266 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 2970 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9266 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:37,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9266 Valid, 1755 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2970 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 06:22:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613513 states. [2025-03-08 06:22:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613513 to 281147. [2025-03-08 06:22:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281147 states, 281146 states have (on average 1.3970214763859348) internal successors, (392767), 281146 states have internal predecessors, (392767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281147 states to 281147 states and 392767 transitions. [2025-03-08 06:22:44,464 INFO L78 Accepts]: Start accepts. Automaton has 281147 states and 392767 transitions. Word has length 62 [2025-03-08 06:22:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:44,464 INFO L471 AbstractCegarLoop]: Abstraction has 281147 states and 392767 transitions. [2025-03-08 06:22:44,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 281147 states and 392767 transitions. [2025-03-08 06:22:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:22:44,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:44,475 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:44,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:22:44,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 06:22:44,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:44,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 902704569, now seen corresponding path program 1 times [2025-03-08 06:22:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:44,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-03-08 06:22:44,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:22:44,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:22:44,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:44,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:22:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193086714] [2025-03-08 06:22:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193086714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:44,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:44,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730938619] [2025-03-08 06:22:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:44,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:44,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:44,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:44,884 INFO L87 Difference]: Start difference. First operand 281147 states and 392767 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:46,395 INFO L93 Difference]: Finished difference Result 459403 states and 641979 transitions. [2025-03-08 06:22:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:22:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:46,674 INFO L225 Difference]: With dead ends: 459403 [2025-03-08 06:22:46,674 INFO L226 Difference]: Without dead ends: 178277 [2025-03-08 06:22:46,790 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-08 06:22:46,790 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:46,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 106 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:22:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178277 states. [2025-03-08 06:22:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178277 to 178277. [2025-03-08 06:22:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178277 states, 178276 states have (on average 1.3738416836814826) internal successors, (244923), 178276 states have internal predecessors, (244923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178277 states to 178277 states and 244923 transitions. [2025-03-08 06:22:49,020 INFO L78 Accepts]: Start accepts. Automaton has 178277 states and 244923 transitions. Word has length 63 [2025-03-08 06:22:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:49,020 INFO L471 AbstractCegarLoop]: Abstraction has 178277 states and 244923 transitions. [2025-03-08 06:22:49,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 178277 states and 244923 transitions. [2025-03-08 06:22:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:22:49,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:49,022 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:49,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:22:49,022 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:49,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash -401980053, now seen corresponding path program 1 times [2025-03-08 06:22:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:49,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498502872] [2025-03-08 06:22:49,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:49,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:22:49,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:22:49,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:49,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:49,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498502872] [2025-03-08 06:22:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498502872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:22:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416137704] [2025-03-08 06:22:49,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:49,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:22:49,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:22:49,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:22:49,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:22:49,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:22:49,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:49,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:49,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 06:22:49,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:22:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:50,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:22:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:22:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416137704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:22:50,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:22:50,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2025-03-08 06:22:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733163330] [2025-03-08 06:22:50,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:22:50,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 06:22:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:50,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 06:22:50,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:22:50,741 INFO L87 Difference]: Start difference. First operand 178277 states and 244923 transitions. Second operand has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:53,120 INFO L93 Difference]: Finished difference Result 438170 states and 601487 transitions. [2025-03-08 06:22:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 06:22:53,121 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 06:22:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:53,609 INFO L225 Difference]: With dead ends: 438170 [2025-03-08 06:22:53,609 INFO L226 Difference]: Without dead ends: 367602 [2025-03-08 06:22:53,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=619, Invalid=2243, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 06:22:53,679 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 2020 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:53,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 976 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:22:53,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367602 states. [2025-03-08 06:22:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367602 to 178837. [2025-03-08 06:22:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178837 states, 178836 states have (on average 1.3747791272450738) internal successors, (245860), 178836 states have internal predecessors, (245860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178837 states to 178837 states and 245860 transitions. [2025-03-08 06:22:56,702 INFO L78 Accepts]: Start accepts. Automaton has 178837 states and 245860 transitions. Word has length 63 [2025-03-08 06:22:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:22:56,702 INFO L471 AbstractCegarLoop]: Abstraction has 178837 states and 245860 transitions. [2025-03-08 06:22:56,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.75) internal successors, (152), 32 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 178837 states and 245860 transitions. [2025-03-08 06:22:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:22:56,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:22:56,704 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:22:56,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:22:56,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:22:56,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:22:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:22:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash -616183089, now seen corresponding path program 1 times [2025-03-08 06:22:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:22:56,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413858140] [2025-03-08 06:22:56,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:22:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:22:56,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:22:56,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:22:56,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:22:56,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:22:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:22:56,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:22:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413858140] [2025-03-08 06:22:56,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413858140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:22:56,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:22:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:22:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407292550] [2025-03-08 06:22:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:22:56,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:22:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:22:56,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:22:56,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:56,950 INFO L87 Difference]: Start difference. First operand 178837 states and 245860 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:22:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:58,222 INFO L93 Difference]: Finished difference Result 335487 states and 461365 transitions. [2025-03-08 06:22:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:22:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:58,424 INFO L225 Difference]: With dead ends: 335487 [2025-03-08 06:22:58,424 INFO L226 Difference]: Without dead ends: 156671 [2025-03-08 06:22:58,484 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-08 06:22:58,485 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:58,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:22:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156671 states. [2025-03-08 06:23:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156671 to 156671. [2025-03-08 06:23:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156671 states, 156670 states have (on average 1.3563413544392673) internal successors, (212498), 156670 states have internal predecessors, (212498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156671 states to 156671 states and 212498 transitions. [2025-03-08 06:23:00,409 INFO L78 Accepts]: Start accepts. Automaton has 156671 states and 212498 transitions. Word has length 64 [2025-03-08 06:23:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:00,409 INFO L471 AbstractCegarLoop]: Abstraction has 156671 states and 212498 transitions. [2025-03-08 06:23:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 156671 states and 212498 transitions. [2025-03-08 06:23:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:23:00,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:00,410 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:23:00,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:23:00,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2135889904, now seen corresponding path program 1 times [2025-03-08 06:23:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:00,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755925092] [2025-03-08 06:23:00,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:00,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:23:00,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:23:00,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:00,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:00,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:00,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755925092] [2025-03-08 06:23:00,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755925092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:00,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:00,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247368077] [2025-03-08 06:23:00,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:00,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:00,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:00,459 INFO L87 Difference]: Start difference. First operand 156671 states and 212498 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:01,464 INFO L93 Difference]: Finished difference Result 210984 states and 286108 transitions. [2025-03-08 06:23:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:23:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:01,531 INFO L225 Difference]: With dead ends: 210984 [2025-03-08 06:23:01,531 INFO L226 Difference]: Without dead ends: 54334 [2025-03-08 06:23:01,580 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-08 06:23:01,581 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:01,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54334 states. [2025-03-08 06:23:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54334 to 50469. [2025-03-08 06:23:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50469 states, 50468 states have (on average 1.343286835222319) internal successors, (67793), 50468 states have internal predecessors, (67793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50469 states to 50469 states and 67793 transitions. [2025-03-08 06:23:02,243 INFO L78 Accepts]: Start accepts. Automaton has 50469 states and 67793 transitions. Word has length 64 [2025-03-08 06:23:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:02,243 INFO L471 AbstractCegarLoop]: Abstraction has 50469 states and 67793 transitions. [2025-03-08 06:23:02,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50469 states and 67793 transitions. [2025-03-08 06:23:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:23:02,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:02,244 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:23:02,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:23:02,244 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:02,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash -109019888, now seen corresponding path program 1 times [2025-03-08 06:23:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:02,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-03-08 06:23:02,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:02,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:02,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:23:02,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:23:02,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:02,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-03-08 06:23:03,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056640750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:03,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897758149] [2025-03-08 06:23:03,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:03,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:03,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:03,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:23:03,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:23:03,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:23:03,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:23:03,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:03,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:03,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 06:23:03,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:04,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897758149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:05,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:05,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 17] total 54 [2025-03-08 06:23:05,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854095093] [2025-03-08 06:23:05,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:05,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 06:23:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:05,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 06:23:05,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2636, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 06:23:05,904 INFO L87 Difference]: Start difference. First operand 50469 states and 67793 transitions. Second operand has 54 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 54 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:13,525 INFO L93 Difference]: Finished difference Result 151444 states and 203372 transitions. [2025-03-08 06:23:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-08 06:23:13,526 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 54 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:23:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:13,637 INFO L225 Difference]: With dead ends: 151444 [2025-03-08 06:23:13,638 INFO L226 Difference]: Without dead ends: 113631 [2025-03-08 06:23:13,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4182 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2372, Invalid=14658, Unknown=0, NotChecked=0, Total=17030 [2025-03-08 06:23:13,657 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 3270 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3270 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:13,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3270 Valid, 2400 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:23:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113631 states. [2025-03-08 06:23:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113631 to 76413. [2025-03-08 06:23:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76413 states, 76412 states have (on average 1.3407187352771817) internal successors, (102447), 76412 states have internal predecessors, (102447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76413 states to 76413 states and 102447 transitions. [2025-03-08 06:23:14,554 INFO L78 Accepts]: Start accepts. Automaton has 76413 states and 102447 transitions. Word has length 64 [2025-03-08 06:23:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:14,554 INFO L471 AbstractCegarLoop]: Abstraction has 76413 states and 102447 transitions. [2025-03-08 06:23:14,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.2037037037037037) internal successors, (173), 54 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 76413 states and 102447 transitions. [2025-03-08 06:23:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:23:14,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:14,555 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:23:14,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:23:14,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 06:23:14,757 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash -192853503, now seen corresponding path program 1 times [2025-03-08 06:23:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-03-08 06:23:14,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:14,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:23:14,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:23:14,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:14,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:23:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-03-08 06:23:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062331942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:14,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:14,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592301311] [2025-03-08 06:23:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:14,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:14,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:14,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:14,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:14,786 INFO L87 Difference]: Start difference. First operand 76413 states and 102447 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:15,015 INFO L93 Difference]: Finished difference Result 137242 states and 184521 transitions. [2025-03-08 06:23:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:15,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 06:23:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:15,080 INFO L225 Difference]: With dead ends: 137242 [2025-03-08 06:23:15,080 INFO L226 Difference]: Without dead ends: 60908 [2025-03-08 06:23:15,123 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-08 06:23:15,123 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 50 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:15,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60908 states. [2025-03-08 06:23:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60908 to 60908. [2025-03-08 06:23:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60908 states, 60907 states have (on average 1.3227215262613492) internal successors, (80563), 60907 states have internal predecessors, (80563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60908 states to 60908 states and 80563 transitions. [2025-03-08 06:23:15,857 INFO L78 Accepts]: Start accepts. Automaton has 60908 states and 80563 transitions. Word has length 65 [2025-03-08 06:23:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 60908 states and 80563 transitions. [2025-03-08 06:23:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 60908 states and 80563 transitions. [2025-03-08 06:23:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:23:15,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:15,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 06:23:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:23:15,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:15,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2086124190, now seen corresponding path program 1 times [2025-03-08 06:23:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526829158] [2025-03-08 06:23:15,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:15,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:23:15,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:23:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:23:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526829158] [2025-03-08 06:23:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526829158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:15,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:15,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:15,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299863052] [2025-03-08 06:23:15,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:15,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:15,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:15,909 INFO L87 Difference]: Start difference. First operand 60908 states and 80563 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-08 06:23:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:16,062 INFO L93 Difference]: Finished difference Result 94011 states and 124682 transitions. [2025-03-08 06:23:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 85 [2025-03-08 06:23:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:16,103 INFO L225 Difference]: With dead ends: 94011 [2025-03-08 06:23:16,103 INFO L226 Difference]: Without dead ends: 33527 [2025-03-08 06:23:16,137 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-08 06:23:16,138 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:16,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 146 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33527 states. [2025-03-08 06:23:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33527 to 33525. [2025-03-08 06:23:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33525 states, 33524 states have (on average 1.3087340412838564) internal successors, (43874), 33524 states have internal predecessors, (43874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33525 states to 33525 states and 43874 transitions. [2025-03-08 06:23:16,716 INFO L78 Accepts]: Start accepts. Automaton has 33525 states and 43874 transitions. Word has length 85 [2025-03-08 06:23:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:16,716 INFO L471 AbstractCegarLoop]: Abstraction has 33525 states and 43874 transitions. [2025-03-08 06:23:16,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-08 06:23:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 33525 states and 43874 transitions. [2025-03-08 06:23:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:23:16,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:16,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 06:23:16,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:23:16,717 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:16,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1675448662, now seen corresponding path program 2 times [2025-03-08 06:23:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:16,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-03-08 06:23:16,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:23:16,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:16,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 06:23:16,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:23:16,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 06:23:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:16,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:16,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-03-08 06:23:16,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798448606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:16,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319829311] [2025-03-08 06:23:16,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:23:16,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:16,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:16,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:23:16,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:23:16,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-08 06:23:16,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:23:16,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 06:23:16,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:16,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:23:16,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:17,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:17,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319829311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:17,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:17,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-08 06:23:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868463879] [2025-03-08 06:23:17,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:17,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:23:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:17,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:23:17,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:23:17,160 INFO L87 Difference]: Start difference. First operand 33525 states and 43874 transitions. Second operand has 14 states, 14 states have (on average 16.5) internal successors, (231), 14 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:17,388 INFO L93 Difference]: Finished difference Result 64430 states and 83719 transitions. [2025-03-08 06:23:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:23:17,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.5) internal successors, (231), 14 states have internal predecessors, (231), 0 states have call successors, (0), 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 86 [2025-03-08 06:23:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:17,420 INFO L225 Difference]: With dead ends: 64430 [2025-03-08 06:23:17,420 INFO L226 Difference]: Without dead ends: 31370 [2025-03-08 06:23:17,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:23:17,441 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 262 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:17,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 407 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:23:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31370 states. [2025-03-08 06:23:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31370 to 31368. [2025-03-08 06:23:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31368 states, 31367 states have (on average 1.2730576720757485) internal successors, (39932), 31367 states have internal predecessors, (39932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31368 states to 31368 states and 39932 transitions. [2025-03-08 06:23:17,802 INFO L78 Accepts]: Start accepts. Automaton has 31368 states and 39932 transitions. Word has length 86 [2025-03-08 06:23:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:17,802 INFO L471 AbstractCegarLoop]: Abstraction has 31368 states and 39932 transitions. [2025-03-08 06:23:17,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.5) internal successors, (231), 14 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31368 states and 39932 transitions. [2025-03-08 06:23:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:23:17,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:17,805 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 06:23:17,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 06:23:18,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:18,010 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:18,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash -111081753, now seen corresponding path program 1 times [2025-03-08 06:23:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:18,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191229399] [2025-03-08 06:23:18,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:18,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:18,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:23:18,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:23:18,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:18,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:23:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191229399] [2025-03-08 06:23:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191229399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396012816] [2025-03-08 06:23:18,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:18,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:18,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:23:18,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:23:18,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:23:18,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:23:18,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:18,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:18,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 06:23:18,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:23:18,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:23:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396012816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:18,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:18,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-08 06:23:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936957634] [2025-03-08 06:23:18,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:18,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:23:18,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:18,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:23:18,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:23:18,542 INFO L87 Difference]: Start difference. First operand 31368 states and 39932 transitions. Second operand has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 14 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:18,827 INFO L93 Difference]: Finished difference Result 54266 states and 68712 transitions. [2025-03-08 06:23:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:23:18,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 14 states have internal predecessors, (260), 0 states have call successors, (0), 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 106 [2025-03-08 06:23:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:18,852 INFO L225 Difference]: With dead ends: 54266 [2025-03-08 06:23:18,852 INFO L226 Difference]: Without dead ends: 28101 [2025-03-08 06:23:18,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:23:18,867 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 318 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:18,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 295 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:23:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28101 states. [2025-03-08 06:23:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28101 to 26708. [2025-03-08 06:23:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26708 states, 26707 states have (on average 1.2488111731006852) internal successors, (33352), 26707 states have internal predecessors, (33352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26708 states to 26708 states and 33352 transitions. [2025-03-08 06:23:19,083 INFO L78 Accepts]: Start accepts. Automaton has 26708 states and 33352 transitions. Word has length 106 [2025-03-08 06:23:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:19,083 INFO L471 AbstractCegarLoop]: Abstraction has 26708 states and 33352 transitions. [2025-03-08 06:23:19,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 14 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 26708 states and 33352 transitions. [2025-03-08 06:23:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:23:19,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:19,085 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:23:19,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 06:23:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:19,286 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:19,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:19,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1319616293, now seen corresponding path program 1 times [2025-03-08 06:23:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746468670] [2025-03-08 06:23:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:19,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:23:19,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:23:19,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:19,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 06:23:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746468670] [2025-03-08 06:23:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746468670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326278118] [2025-03-08 06:23:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:19,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:19,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:19,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:19,338 INFO L87 Difference]: Start difference. First operand 26708 states and 33352 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:19,396 INFO L93 Difference]: Finished difference Result 38419 states and 48387 transitions. [2025-03-08 06:23:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 106 [2025-03-08 06:23:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:19,409 INFO L225 Difference]: With dead ends: 38419 [2025-03-08 06:23:19,409 INFO L226 Difference]: Without dead ends: 12035 [2025-03-08 06:23:19,421 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-08 06:23:19,423 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 23 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:19,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12035 states. [2025-03-08 06:23:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12035 to 12033. [2025-03-08 06:23:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12033 states, 12032 states have (on average 1.2623836436170213) internal successors, (15189), 12032 states have internal predecessors, (15189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 15189 transitions. [2025-03-08 06:23:19,515 INFO L78 Accepts]: Start accepts. Automaton has 12033 states and 15189 transitions. Word has length 106 [2025-03-08 06:23:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:19,515 INFO L471 AbstractCegarLoop]: Abstraction has 12033 states and 15189 transitions. [2025-03-08 06:23:19,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:23:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 12033 states and 15189 transitions. [2025-03-08 06:23:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:23:19,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:19,516 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:23:19,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:23:19,516 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:23:19,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash 577697691, now seen corresponding path program 1 times [2025-03-08 06:23:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:19,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164923263] [2025-03-08 06:23:19,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:19,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:23:19,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:23:19,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:19,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 22 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:19,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164923263] [2025-03-08 06:23:19,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164923263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:19,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197224616] [2025-03-08 06:23:19,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:19,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:19,881 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:23:19,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:23:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:23:19,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:23:19,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:19,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:20,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 06:23:20,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:20,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197224616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:21,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 50 [2025-03-08 06:23:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526923486] [2025-03-08 06:23:21,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:21,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-08 06:23:21,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:21,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-08 06:23:21,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2287, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 06:23:21,974 INFO L87 Difference]: Start difference. First operand 12033 states and 15189 transitions. Second operand has 50 states, 50 states have (on average 5.96) internal successors, (298), 50 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)