./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.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.4.ufo.BOUNDED-8.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 8e8985b7b99a6dec53be0ba16cc0e7b241934830d919fef1f601cc1b51084525 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:24:09,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:24:09,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:24:09,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:24:09,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:24:09,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:24:09,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:24:09,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:24:09,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:24:09,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:24:09,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:24:09,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:24:09,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:24:09,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:24:09,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:24:09,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:24:09,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:24:09,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:24:09,678 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 -> 8e8985b7b99a6dec53be0ba16cc0e7b241934830d919fef1f601cc1b51084525 [2025-03-08 06:24:09,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:24:09,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:24:09,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:24:09,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:24:09,909 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:24:09,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:24:11,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090229b2b/27576e905ab542828b1af661779e7359/FLAG4c6f6eb79 [2025-03-08 06:24:11,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:24:11,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:24:11,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090229b2b/27576e905ab542828b1af661779e7359/FLAG4c6f6eb79 [2025-03-08 06:24:11,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090229b2b/27576e905ab542828b1af661779e7359 [2025-03-08 06:24:11,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:24:11,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:24:11,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:24:11,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:24:11,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:24:11,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4478fc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11, skipping insertion in model container [2025-03-08 06:24:11,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:24:11,755 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.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4900,4913] [2025-03-08 06:24:11,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:24:11,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:24:11,829 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.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[4900,4913] [2025-03-08 06:24:11,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:24:11,855 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:24:11,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11 WrapperNode [2025-03-08 06:24:11,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:24:11,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:24:11,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:24:11,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:24:11,863 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:24:11" (1/1) ... [2025-03-08 06:24:11,871 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:24:11" (1/1) ... [2025-03-08 06:24:11,900 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 374 [2025-03-08 06:24:11,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:24:11,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:24:11,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:24:11,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:24:11,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,931 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:24:11,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:24:11,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:24:11,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:24:11,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:24:11,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (1/1) ... [2025-03-08 06:24:11,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:24:11,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:11,979 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:24:11,981 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:24:11,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:24:11,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:24:11,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:24:11,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:24:12,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:24:12,075 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:24:12,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc main_~node3__m3~0#1; [2025-03-08 06:24:12,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:24:12,339 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc main_~node2__m2~0#1; [2025-03-08 06:24:12,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L153: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:24:12,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L443: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:24:12,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:24:12,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: 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:24:12,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc main_~node4__m4~0#1; [2025-03-08 06:24:12,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:24:12,353 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-08 06:24:12,353 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:24:12,362 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:24:12,364 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:24:12,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:24:12 BoogieIcfgContainer [2025-03-08 06:24:12,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:24:12,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:24:12,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:24:12,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:24:12,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:24:11" (1/3) ... [2025-03-08 06:24:12,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3514a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:24:12, skipping insertion in model container [2025-03-08 06:24:12,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:24:11" (2/3) ... [2025-03-08 06:24:12,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3514a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:24:12, skipping insertion in model container [2025-03-08 06:24:12,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:24:12" (3/3) ... [2025-03-08 06:24:12,372 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-08 06:24:12,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:24:12,384 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 79 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:24:12,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:24:12,428 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;@7629584b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:24:12,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:24:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:24:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:24:12,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:12,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:12,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1983963079, now seen corresponding path program 1 times [2025-03-08 06:24:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:12,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322466529] [2025-03-08 06:24:12,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:12,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:24:12,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:24:12,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:12,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:12,758 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:24:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322466529] [2025-03-08 06:24:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322466529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:12,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:12,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359105176] [2025-03-08 06:24:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:12,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:12,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:12,788 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.7272727272727273) internal successors, (133), 78 states have internal predecessors, (133), 0 states have call successors, (0), 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 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:24:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:12,833 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2025-03-08 06:24:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:12,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:24:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:12,841 INFO L225 Difference]: With dead ends: 177 [2025-03-08 06:24:12,841 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 06:24:12,843 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:24:12,845 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 91 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 277 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:24:12,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 06:24:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-08 06:24:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 115 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:24:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2025-03-08 06:24:12,873 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 47 [2025-03-08 06:24:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:12,873 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2025-03-08 06:24:12,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:24:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2025-03-08 06:24:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 06:24:12,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:12,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:12,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:24:12,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 996552528, now seen corresponding path program 1 times [2025-03-08 06:24:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427080969] [2025-03-08 06:24:12,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:12,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 06:24:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 06:24:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:12,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,013 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:24:13,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427080969] [2025-03-08 06:24:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427080969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376097243] [2025-03-08 06:24:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:13,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:13,017 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:24:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,043 INFO L93 Difference]: Finished difference Result 280 states and 429 transitions. [2025-03-08 06:24:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:13,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-08 06:24:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,046 INFO L225 Difference]: With dead ends: 280 [2025-03-08 06:24:13,047 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 06:24:13,047 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:24:13,048 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 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:24:13,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 06:24:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-03-08 06:24:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.5133689839572193) internal successors, (283), 187 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:24:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2025-03-08 06:24:13,058 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 48 [2025-03-08 06:24:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,059 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2025-03-08 06:24:13,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:24:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2025-03-08 06:24:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 06:24:13,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:24:13,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:13,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1539141012, now seen corresponding path program 1 times [2025-03-08 06:24:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336056483] [2025-03-08 06:24:13,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 06:24:13,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 06:24:13,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,177 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:24:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336056483] [2025-03-08 06:24:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336056483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829629880] [2025-03-08 06:24:13,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:13,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:13,178 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:24:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,195 INFO L93 Difference]: Finished difference Result 480 states and 745 transitions. [2025-03-08 06:24:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-08 06:24:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,198 INFO L225 Difference]: With dead ends: 480 [2025-03-08 06:24:13,199 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 06:24:13,199 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:24:13,200 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 233 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:24:13,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 06:24:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2025-03-08 06:24:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.5333333333333334) internal successors, (483), 315 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:24:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 483 transitions. [2025-03-08 06:24:13,217 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 483 transitions. Word has length 49 [2025-03-08 06:24:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,217 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 483 transitions. [2025-03-08 06:24:13,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:24:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 483 transitions. [2025-03-08 06:24:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:24:13,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:13,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:24:13,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:13,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1645998845, now seen corresponding path program 1 times [2025-03-08 06:24:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518343703] [2025-03-08 06:24:13,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:24:13,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:24:13,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,306 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:24:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518343703] [2025-03-08 06:24:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518343703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166671507] [2025-03-08 06:24:13,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:13,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:13,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:13,309 INFO L87 Difference]: Start difference. First operand 316 states and 483 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:24:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,328 INFO L93 Difference]: Finished difference Result 832 states and 1293 transitions. [2025-03-08 06:24:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-08 06:24:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,331 INFO L225 Difference]: With dead ends: 832 [2025-03-08 06:24:13,331 INFO L226 Difference]: Without dead ends: 542 [2025-03-08 06:24:13,331 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:24:13,332 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 229 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:24:13,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 229 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-08 06:24:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2025-03-08 06:24:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.5343228200371057) internal successors, (827), 539 states have internal predecessors, (827), 0 states have call successors, (0), 0 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:24:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 827 transitions. [2025-03-08 06:24:13,345 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 827 transitions. Word has length 50 [2025-03-08 06:24:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 827 transitions. [2025-03-08 06:24:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:24:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 827 transitions. [2025-03-08 06:24:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:24:13,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:24:13,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1271575649, now seen corresponding path program 1 times [2025-03-08 06:24:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-08 06:24:13,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:24:13,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:24:13,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,487 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:24:13,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-08 06:24:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826152392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093832170] [2025-03-08 06:24:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:13,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:13,488 INFO L87 Difference]: Start difference. First operand 540 states and 827 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:24:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,641 INFO L93 Difference]: Finished difference Result 4652 states and 7235 transitions. [2025-03-08 06:24:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:24:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-08 06:24:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,659 INFO L225 Difference]: With dead ends: 4652 [2025-03-08 06:24:13,660 INFO L226 Difference]: Without dead ends: 4138 [2025-03-08 06:24:13,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:24:13,663 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 683 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:13,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 898 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2025-03-08 06:24:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 1052. [2025-03-08 06:24:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.5176022835394862) internal successors, (1595), 1051 states have internal predecessors, (1595), 0 states have call successors, (0), 0 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:24:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1595 transitions. [2025-03-08 06:24:13,718 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1595 transitions. Word has length 51 [2025-03-08 06:24:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,719 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1595 transitions. [2025-03-08 06:24:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:24:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1595 transitions. [2025-03-08 06:24:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:24:13,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:13,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:24:13,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:13,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2042597206, now seen corresponding path program 1 times [2025-03-08 06:24:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-03-08 06:24:13,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:24:13,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:24:13,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:13,802 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:24:13,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-03-08 06:24:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298574078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589323574] [2025-03-08 06:24:13,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:13,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:13,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:13,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:13,803 INFO L87 Difference]: Start difference. First operand 1052 states and 1595 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:24:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:13,830 INFO L93 Difference]: Finished difference Result 2570 states and 3911 transitions. [2025-03-08 06:24:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-08 06:24:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:13,835 INFO L225 Difference]: With dead ends: 2570 [2025-03-08 06:24:13,835 INFO L226 Difference]: Without dead ends: 1544 [2025-03-08 06:24:13,836 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:24:13,836 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 201 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:24:13,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 201 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-08 06:24:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2025-03-08 06:24:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5035691109669047) internal successors, (2317), 1541 states have internal predecessors, (2317), 0 states have call successors, (0), 0 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:24:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2317 transitions. [2025-03-08 06:24:13,871 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2317 transitions. Word has length 53 [2025-03-08 06:24:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2317 transitions. [2025-03-08 06:24:13,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:24:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2317 transitions. [2025-03-08 06:24:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:24:13,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:13,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:24:13,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:13,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2041435357, now seen corresponding path program 1 times [2025-03-08 06:24:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154367976] [2025-03-08 06:24:13,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:24:13,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:24:13,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,098 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:24:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154367976] [2025-03-08 06:24:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154367976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:14,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012387840] [2025-03-08 06:24:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:14,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:14,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:14,101 INFO L87 Difference]: Start difference. First operand 1542 states and 2317 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:24:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:14,209 INFO L93 Difference]: Finished difference Result 3058 states and 4607 transitions. [2025-03-08 06:24:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-08 06:24:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:14,214 INFO L225 Difference]: With dead ends: 3058 [2025-03-08 06:24:14,214 INFO L226 Difference]: Without dead ends: 1544 [2025-03-08 06:24:14,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:24:14,217 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 208 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:14,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 324 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-08 06:24:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1542. [2025-03-08 06:24:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.4879948085658663) internal successors, (2293), 1541 states have internal predecessors, (2293), 0 states have call successors, (0), 0 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:24:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2293 transitions. [2025-03-08 06:24:14,240 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2293 transitions. Word has length 53 [2025-03-08 06:24:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2293 transitions. [2025-03-08 06:24:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:24:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2293 transitions. [2025-03-08 06:24:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:24:14,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:14,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:24:14,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1140968741, now seen corresponding path program 1 times [2025-03-08 06:24:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769904843] [2025-03-08 06:24:14,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:14,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:24:14,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:24:14,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:14,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,453 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:24:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769904843] [2025-03-08 06:24:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769904843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:14,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:14,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:24:14,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041347968] [2025-03-08 06:24:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:14,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:24:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:14,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:24:14,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:24:14,455 INFO L87 Difference]: Start difference. First operand 1542 states and 2293 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:24:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:14,482 INFO L93 Difference]: Finished difference Result 1608 states and 2390 transitions. [2025-03-08 06:24:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:24:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-08 06:24:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:14,487 INFO L225 Difference]: With dead ends: 1608 [2025-03-08 06:24:14,487 INFO L226 Difference]: Without dead ends: 1606 [2025-03-08 06:24:14,487 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:24:14,488 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 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:24:14,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-08 06:24:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-08 06:24:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.4635514018691589) internal successors, (2349), 1605 states have internal predecessors, (2349), 0 states have call successors, (0), 0 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:24:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2349 transitions. [2025-03-08 06:24:14,510 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2349 transitions. Word has length 54 [2025-03-08 06:24:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:14,510 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2349 transitions. [2025-03-08 06:24:14,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:24:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2349 transitions. [2025-03-08 06:24:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:24:14,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:14,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:14,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:24:14,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:14,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash -805800741, now seen corresponding path program 1 times [2025-03-08 06:24:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:14,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-03-08 06:24:14,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:14,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:24:14,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:24:14,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:14,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:24:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-03-08 06:24:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913904592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057364441] [2025-03-08 06:24:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:14,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:14,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:14,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:14,637 INFO L87 Difference]: Start difference. First operand 1606 states and 2349 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:24:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:14,752 INFO L93 Difference]: Finished difference Result 8224 states and 12058 transitions. [2025-03-08 06:24:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 76 [2025-03-08 06:24:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:14,771 INFO L225 Difference]: With dead ends: 8224 [2025-03-08 06:24:14,771 INFO L226 Difference]: Without dead ends: 6646 [2025-03-08 06:24:14,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:14,775 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 438 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:14,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 631 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2025-03-08 06:24:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 3182. [2025-03-08 06:24:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.4602326312480352) internal successors, (4645), 3181 states have internal predecessors, (4645), 0 states have call successors, (0), 0 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:24:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4645 transitions. [2025-03-08 06:24:14,857 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4645 transitions. Word has length 76 [2025-03-08 06:24:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:14,857 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4645 transitions. [2025-03-08 06:24:14,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:24:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4645 transitions. [2025-03-08 06:24:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:24:14,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:14,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:14,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:24:14,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:14,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1345919099, now seen corresponding path program 1 times [2025-03-08 06:24:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-03-08 06:24:14,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:14,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:24:14,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:24:14,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:14,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:24:14,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-03-08 06:24:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263896957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:14,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016461498] [2025-03-08 06:24:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:14,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:14,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:14,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:14,953 INFO L87 Difference]: Start difference. First operand 3182 states and 4645 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:24:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:15,049 INFO L93 Difference]: Finished difference Result 9800 states and 14354 transitions. [2025-03-08 06:24:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:15,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 76 [2025-03-08 06:24:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:15,075 INFO L225 Difference]: With dead ends: 9800 [2025-03-08 06:24:15,075 INFO L226 Difference]: Without dead ends: 8222 [2025-03-08 06:24:15,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:15,079 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 471 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:15,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 563 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2025-03-08 06:24:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 5550. [2025-03-08 06:24:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5550 states, 5549 states have (on average 1.4541358803387998) internal successors, (8069), 5549 states have internal predecessors, (8069), 0 states have call successors, (0), 0 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:24:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5550 states to 5550 states and 8069 transitions. [2025-03-08 06:24:15,172 INFO L78 Accepts]: Start accepts. Automaton has 5550 states and 8069 transitions. Word has length 76 [2025-03-08 06:24:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:15,172 INFO L471 AbstractCegarLoop]: Abstraction has 5550 states and 8069 transitions. [2025-03-08 06:24:15,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:24:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5550 states and 8069 transitions. [2025-03-08 06:24:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:24:15,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:15,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:15,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:24:15,174 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:15,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1553763355, now seen corresponding path program 1 times [2025-03-08 06:24:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:15,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549318819] [2025-03-08 06:24:15,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:15,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:24:15,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:24:15,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:15,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:15,278 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:24:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:15,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549318819] [2025-03-08 06:24:15,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549318819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:15,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:15,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010568247] [2025-03-08 06:24:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:15,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:15,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:15,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:15,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:15,279 INFO L87 Difference]: Start difference. First operand 5550 states and 8069 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:24:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:15,398 INFO L93 Difference]: Finished difference Result 11376 states and 16650 transitions. [2025-03-08 06:24:15,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:15,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 76 [2025-03-08 06:24:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:15,412 INFO L225 Difference]: With dead ends: 11376 [2025-03-08 06:24:15,413 INFO L226 Difference]: Without dead ends: 9798 [2025-03-08 06:24:15,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:15,416 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 448 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:15,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 612 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9798 states. [2025-03-08 06:24:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9798 to 7126. [2025-03-08 06:24:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7126 states, 7125 states have (on average 1.454736842105263) internal successors, (10365), 7125 states have internal predecessors, (10365), 0 states have call successors, (0), 0 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:24:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7126 states to 7126 states and 10365 transitions. [2025-03-08 06:24:15,517 INFO L78 Accepts]: Start accepts. Automaton has 7126 states and 10365 transitions. Word has length 76 [2025-03-08 06:24:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:15,517 INFO L471 AbstractCegarLoop]: Abstraction has 7126 states and 10365 transitions. [2025-03-08 06:24:15,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:24:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7126 states and 10365 transitions. [2025-03-08 06:24:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:24:15,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:15,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:15,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:24:15,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:15,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1844617531, now seen corresponding path program 1 times [2025-03-08 06:24:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:15,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919457811] [2025-03-08 06:24:15,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:15,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:24:15,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:24:15,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:15,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:24:15,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:15,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919457811] [2025-03-08 06:24:15,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919457811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:15,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:15,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:24:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331163078] [2025-03-08 06:24:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:24:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:15,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:24:15,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:24:15,637 INFO L87 Difference]: Start difference. First operand 7126 states and 10365 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:24:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:15,738 INFO L93 Difference]: Finished difference Result 11976 states and 17538 transitions. [2025-03-08 06:24:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:24:15,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 76 [2025-03-08 06:24:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:15,756 INFO L225 Difference]: With dead ends: 11976 [2025-03-08 06:24:15,757 INFO L226 Difference]: Without dead ends: 10886 [2025-03-08 06:24:15,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:24:15,762 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 439 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:15,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 686 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:24:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2025-03-08 06:24:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 8214. [2025-03-08 06:24:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8214 states, 8213 states have (on average 1.4568367222695726) internal successors, (11965), 8213 states have internal predecessors, (11965), 0 states have call successors, (0), 0 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:24:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8214 states to 8214 states and 11965 transitions. [2025-03-08 06:24:15,871 INFO L78 Accepts]: Start accepts. Automaton has 8214 states and 11965 transitions. Word has length 76 [2025-03-08 06:24:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:15,871 INFO L471 AbstractCegarLoop]: Abstraction has 8214 states and 11965 transitions. [2025-03-08 06:24:15,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:24:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8214 states and 11965 transitions. [2025-03-08 06:24:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:24:15,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:15,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:15,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:24:15,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1757472576, now seen corresponding path program 1 times [2025-03-08 06:24:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:15,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139039069] [2025-03-08 06:24:15,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:15,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:15,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:24:15,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:24:15,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:15,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:16,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:16,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139039069] [2025-03-08 06:24:16,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139039069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:16,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428982685] [2025-03-08 06:24:16,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:16,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:16,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:16,145 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:24:16,147 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:24:16,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:24:16,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:24:16,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:16,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:16,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:24:16,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:16,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:16,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428982685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:16,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:16,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 17 [2025-03-08 06:24:16,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228590134] [2025-03-08 06:24:16,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:16,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 06:24:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:16,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 06:24:16,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:24:16,984 INFO L87 Difference]: Start difference. First operand 8214 states and 11965 transitions. Second operand has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:24:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:18,959 INFO L93 Difference]: Finished difference Result 57300 states and 83342 transitions. [2025-03-08 06:24:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-08 06:24:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 06:24:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:19,031 INFO L225 Difference]: With dead ends: 57300 [2025-03-08 06:24:19,032 INFO L226 Difference]: Without dead ends: 49114 [2025-03-08 06:24:19,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1246, Invalid=5396, Unknown=0, NotChecked=0, Total=6642 [2025-03-08 06:24:19,046 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 2463 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:19,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2463 Valid, 771 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:24:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49114 states. [2025-03-08 06:24:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49114 to 41278. [2025-03-08 06:24:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41278 states, 41277 states have (on average 1.4188046611914626) internal successors, (58564), 41277 states have internal predecessors, (58564), 0 states have call successors, (0), 0 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:24:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41278 states to 41278 states and 58564 transitions. [2025-03-08 06:24:19,666 INFO L78 Accepts]: Start accepts. Automaton has 41278 states and 58564 transitions. Word has length 77 [2025-03-08 06:24:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:19,666 INFO L471 AbstractCegarLoop]: Abstraction has 41278 states and 58564 transitions. [2025-03-08 06:24:19,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:24:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 41278 states and 58564 transitions. [2025-03-08 06:24:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:24:19,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:19,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:19,675 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:24:19,869 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,SelfDestructingSolverStorable12 [2025-03-08 06:24:19,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:19,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash -443481417, now seen corresponding path program 1 times [2025-03-08 06:24:19,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:19,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063262595] [2025-03-08 06:24:19,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:19,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:24:19,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:24:19,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:19,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:20,162 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:24:20,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063262595] [2025-03-08 06:24:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063262595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:20,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450173593] [2025-03-08 06:24:20,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:20,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:20,165 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:24:20,167 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:24:20,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:24:20,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:24:20,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:20,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:20,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 06:24:20,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:21,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:23,172 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:24:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450173593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:23,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 19] total 40 [2025-03-08 06:24:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194362683] [2025-03-08 06:24:23,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:23,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 06:24:23,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:23,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 06:24:23,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 06:24:23,174 INFO L87 Difference]: Start difference. First operand 41278 states and 58564 transitions. Second operand has 40 states, 40 states have (on average 5.225) internal successors, (209), 40 states have internal predecessors, (209), 0 states have call successors, (0), 0 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:24:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:35,957 INFO L93 Difference]: Finished difference Result 803937 states and 1137397 transitions. [2025-03-08 06:24:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2025-03-08 06:24:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.225) internal successors, (209), 40 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:24:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:37,341 INFO L225 Difference]: With dead ends: 803937 [2025-03-08 06:24:37,342 INFO L226 Difference]: Without dead ends: 762689 [2025-03-08 06:24:37,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31897 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13326, Invalid=59844, Unknown=0, NotChecked=0, Total=73170 [2025-03-08 06:24:37,644 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 6778 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 5581 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6778 SdHoareTripleChecker+Valid, 3741 SdHoareTripleChecker+Invalid, 5700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 5581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:37,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6778 Valid, 3741 Invalid, 5700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 5581 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 06:24:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762689 states. [2025-03-08 06:24:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762689 to 400110. [2025-03-08 06:24:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400110 states, 400109 states have (on average 1.3967818769385343) internal successors, (558865), 400109 states have internal predecessors, (558865), 0 states have call successors, (0), 0 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:24:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400110 states to 400110 states and 558865 transitions. [2025-03-08 06:24:45,168 INFO L78 Accepts]: Start accepts. Automaton has 400110 states and 558865 transitions. Word has length 78 [2025-03-08 06:24:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:45,168 INFO L471 AbstractCegarLoop]: Abstraction has 400110 states and 558865 transitions. [2025-03-08 06:24:45,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.225) internal successors, (209), 40 states have internal predecessors, (209), 0 states have call successors, (0), 0 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:24:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 400110 states and 558865 transitions. [2025-03-08 06:24:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:24:45,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:45,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:45,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:24:45,376 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,SelfDestructingSolverStorable13 [2025-03-08 06:24:45,377 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -275994838, now seen corresponding path program 1 times [2025-03-08 06:24:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623887258] [2025-03-08 06:24:45,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:45,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:24:45,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:24:45,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:45,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:45,425 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:24:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623887258] [2025-03-08 06:24:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623887258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148206422] [2025-03-08 06:24:45,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:45,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:45,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:45,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:45,426 INFO L87 Difference]: Start difference. First operand 400110 states and 558865 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:24:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:47,512 INFO L93 Difference]: Finished difference Result 746871 states and 1043724 transitions. [2025-03-08 06:24:47,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:47,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-08 06:24:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:47,932 INFO L225 Difference]: With dead ends: 746871 [2025-03-08 06:24:47,932 INFO L226 Difference]: Without dead ends: 347291 [2025-03-08 06:24:48,029 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:24:48,033 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:48,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 143 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347291 states. [2025-03-08 06:24:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347291 to 347291. [2025-03-08 06:24:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347291 states, 347290 states have (on average 1.3795819056120244) internal successors, (479115), 347290 states have internal predecessors, (479115), 0 states have call successors, (0), 0 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:24:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347291 states to 347291 states and 479115 transitions. [2025-03-08 06:24:52,035 INFO L78 Accepts]: Start accepts. Automaton has 347291 states and 479115 transitions. Word has length 79 [2025-03-08 06:24:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:52,036 INFO L471 AbstractCegarLoop]: Abstraction has 347291 states and 479115 transitions. [2025-03-08 06:24:52,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:24:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 347291 states and 479115 transitions. [2025-03-08 06:24:52,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:24:52,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:52,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:52,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:24:52,048 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:52,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1909949093, now seen corresponding path program 1 times [2025-03-08 06:24:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882171455] [2025-03-08 06:24:52,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:52,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:24:52,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:24:52,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:52,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:52,126 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:24:52,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882171455] [2025-03-08 06:24:52,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882171455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:24:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255069688] [2025-03-08 06:24:52,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:52,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:24:52,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:52,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:24:52,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:24:52,128 INFO L87 Difference]: Start difference. First operand 347291 states and 479115 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:54,587 INFO L93 Difference]: Finished difference Result 685650 states and 947695 transitions. [2025-03-08 06:24:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:24:54,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-08 06:24:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:54,985 INFO L225 Difference]: With dead ends: 685650 [2025-03-08 06:24:54,985 INFO L226 Difference]: Without dead ends: 340213 [2025-03-08 06:24:55,083 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:24:55,083 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 226 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:24:55,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:24:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340213 states. [2025-03-08 06:24:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340213 to 335003. [2025-03-08 06:24:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335003 states, 335002 states have (on average 1.3664097527775954) internal successors, (457750), 335002 states have internal predecessors, (457750), 0 states have call successors, (0), 0 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:24:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335003 states to 335003 states and 457750 transitions. [2025-03-08 06:24:59,285 INFO L78 Accepts]: Start accepts. Automaton has 335003 states and 457750 transitions. Word has length 79 [2025-03-08 06:24:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 335003 states and 457750 transitions. [2025-03-08 06:24:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:24:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 335003 states and 457750 transitions. [2025-03-08 06:24:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:24:59,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:59,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:24:59,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:24:59,287 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:24:59,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1674048091, now seen corresponding path program 1 times [2025-03-08 06:24:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195402599] [2025-03-08 06:24:59,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:59,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:24:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:24:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195402599] [2025-03-08 06:24:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195402599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228755373] [2025-03-08 06:24:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:59,514 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:24:59,516 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:24:59,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:24:59,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:24:59,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:59,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:59,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:24:59,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:59,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:25:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228755373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:25:00,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:25:00,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 06:25:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034247725] [2025-03-08 06:25:00,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:25:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:25:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:00,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:25:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:25:00,293 INFO L87 Difference]: Start difference. First operand 335003 states and 457750 transitions. Second operand has 21 states, 21 states have (on average 9.095238095238095) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)